dilsonpereira / Minimum-Cost-Perfect-Matching
C++ implementation of algorithms for finding perfect matchings in general graphs
☆65Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for Minimum-Cost-Perfect-Matching
- Implementations of different algorithms for building Euclidean minimum spanning tree in k-dimensional space.☆23Updated 3 years ago
- Library for finding maximum cliques on graphs☆15Updated 2 years ago
- An open implementation of the MC family of maximum clique algorithms☆9Updated 8 years ago
- This is the working repository for the CSDP project. CSDP is a solver for semidefinite programming problems. It is a COIN-OR project.☆57Updated 2 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆70Updated this week
- Parallel Presolve for Integer and Linear Optimization☆64Updated this week
- Sequential object-oriented simPlex☆61Updated this week
- A standalone local search solver for general integer linear programming☆15Updated 4 months ago
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆57Updated 6 months ago
- Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup☆17Updated last year
- Parallel Presolve for Integer and Linear Optimization☆38Updated 3 years ago
- LEMON Graph Library☆32Updated 4 years ago
- C++ Implementation of Traveling Salesman Problem using Christofides and 2-opt☆69Updated 10 years ago
- binary/integer linear programming solver☆14Updated last week
- Advance algorithm implementations☆13Updated 3 years ago
- Branch-Cut-Price Framework☆27Updated 4 years ago
- data files for comparing optimal transport algorithms☆9Updated 4 years ago
- A C++ implementation of Network Simplex Algorithm☆11Updated 6 years ago
- Cut Generator Library☆24Updated 3 weeks ago
- A C++ wrapper for SCIP☆20Updated this week
- COIN-OR Utilities☆45Updated 3 weeks ago
- Steiner tree solver☆29Updated 6 years ago
- Quickly compute all maximal cliques of a graph☆75Updated 6 years ago
- ☆13Updated last year
- A set of tools to solve TSP problems using the LKH solver☆89Updated 9 years ago
- C++ library for a binary quadratic model☆13Updated last month
- OptFrame - C++17 (and C++20) Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆71Updated 5 months ago
- C++ metaheuristics modeler/solver for general integer optimization problems.☆45Updated last month
- Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.☆13Updated 2 years ago
- Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. It was cre…☆81Updated 2 years ago