dilsonpereira / Minimum-Cost-Perfect-MatchingLinks
C++ implementation of algorithms for finding perfect matchings in general graphs
☆74Updated 3 years ago
Alternatives and similar repositories for Minimum-Cost-Perfect-Matching
Users that are interested in Minimum-Cost-Perfect-Matching are comparing it to the libraries listed below
Sorting:
- Implementations of different algorithms for building Euclidean minimum spanning tree in k-dimensional space.☆22Updated 4 years ago
- Library for finding maximum cliques on graphs☆16Updated 3 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated last month
- Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. It was cre…☆104Updated 3 years ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆497Updated last month
- Quickly compute all maximal cliques of a graph☆80Updated 7 years ago
- Parallel Maximum Clique Library☆118Updated 2 years ago
- Sequential object-oriented simPlex☆70Updated last week
- VieCut 1.00 - Shared-memory Minimum Cuts☆47Updated 2 years ago
- OptFrame - C++17/C++20/C++23 Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆90Updated 2 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆464Updated 3 weeks ago
- An open implementation of the MC family of maximum clique algorithms☆12Updated 9 years ago
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 3 years ago
- A collection of min-cut/max-flow algorithms.☆50Updated 3 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated this week
- Python implementation of various max-cut problem solvers.☆22Updated 6 years ago
- COIN-OR Linear Programming Solver☆472Updated 3 weeks ago
- SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support☆53Updated this week
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆167Updated last week
- General implementation of the PQ Tree algorithm.☆29Updated 14 years ago
- Fast C++ implementation of an O(NM) algorithm for the assignment problem.☆54Updated 4 years ago
- An evolutionary computation framework to (automatically) build fast parallel stochastic optimization solvers☆117Updated 7 months ago
- This is the working repository for the CSDP project. CSDP is a solver for semidefinite programming problems. It is a COIN-OR project.☆60Updated 3 years ago
- Graph Coarsening and Partitioning Library☆33Updated 5 years ago
- Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.☆15Updated 5 months ago
- Parallel Graph Input Output☆18Updated 2 years ago
- SuiteSparse graph algorithms in the language of linear algebra. For production: (default) STABLE branch. Code development: ask me for t…☆393Updated this week
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆61Updated last year
- Parallel Presolve for Integer and Linear Optimization☆76Updated last week
- ☆50Updated 3 years ago