jwalteros / dOmega
Library for finding maximum cliques on graphs
☆15Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for dOmega
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆57Updated 6 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆72Updated 2 weeks ago
- An open implementation of the MC family of maximum clique algorithms☆9Updated 8 years ago
- ☆10Updated 7 years ago
- A standalone local search solver for general integer linear programming☆15Updated 4 months ago
- Dynamic data structure for sparse graphs.☆27Updated 7 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated this week
- GBBS: Graph Based Benchmark Suite☆195Updated last week
- Parallel Graph Input Output☆17Updated last year
- Quickly compute all maximal cliques of a graph☆75Updated 6 years ago
- Near-linear time algorithm for computing near-maximum independent set☆17Updated 2 years ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- A solver for the generalized assignment problem☆24Updated 4 months ago
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 2 years ago
- A C++ Framework for Optimization☆27Updated this week
- ☆12Updated 2 months ago
- Algorithms to list k-cliques in real-world graphs☆24Updated 3 years ago
- A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#☆80Updated 5 months ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆11Updated 2 years ago
- CPAM: Compressed Parallel Augmented Maps☆23Updated last month
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆21Updated last year
- C++ metaheuristics modeler/solver for general integer optimization problems.☆45Updated this week
- Combinatorial Optimization in Gurobi☆42Updated last year
- Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.☆13Updated 2 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- This is the Web site associated with the repository for hosting software and data associated with papers appearing in the INFORMS Journal…☆15Updated this week
- ☆23Updated 2 years ago
- A standalone local search solver for general mixed integer programming☆13Updated 3 months ago
- Branch-Cut-Price Framework☆27Updated 4 years ago
- Nutmeg – a MIP and CP branch-and-check solver☆23Updated last year