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

• VieCut / VieCut
  VieCut 1.00 - Shared-memory Minimum Cuts
  ☆45Updated 2 years ago
• alberto-santini / cplex-example
  Solving a TSP with the CPLEX C++ API.
  ☆51Updated 4 years ago
• optframe / optframe
  OptFrame - C++17 (and C++20) Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…
  ☆80Updated last week
• tpet / lemon
  LEMON Graph Library
  ☆39Updated 5 years ago
• coin-or / Bcp
  Branch-Cut-Price Framework
  ☆29Updated 4 years ago
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆115Updated last year
• jwalteros / dOmega
  Library for finding maximum cliques on graphs
  ☆15Updated 3 years ago
• beckysag / traveling-salesman
  C++ Implementation of Traveling Salesman Problem using Christofides and 2-opt
  ☆69Updated 11 years ago
• scipopt / soplex
  Sequential object-oriented simPlex
  ☆64Updated last week
• lgottwald / PaPILO
  Parallel Presolve for Integer and Linear Optimization
  ☆40Updated 3 years ago
• wata-orz / steiner_tree
  Steiner tree solver
  ☆30Updated 6 years ago
• firedrakeproject / glpk
  GNU Linear Programming Kit
  ☆47Updated 4 years ago
• quesnel / baryonyx
  binary/integer linear programming solver
  ☆16Updated 5 months ago
• LPMP / BDD
  An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…
  ☆59Updated 11 months ago
• renault-iaa / challenge-roadef-2022
  challenge EURO/ROADEF 2022 on RENAULT's truck loading : documents and issues
  ☆29Updated last year
• laser-ufpb / CVRPController
  CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.
  ☆22Updated 3 years ago
• ScottKolo / Mongoose
  Graph Coarsening and Partitioning Library
  ☆32Updated 5 years ago
• bolner / SimplexSolver
  An easy-to-use Simplex solver class for linear programming.
  ☆20Updated 7 years ago
• jamespayor / weighted-bipartite-perfect-matching
  Fast C++ implementation of an O(NM) algorithm for the assignment problem.
  ☆53Updated 3 years ago
• coin-or / CoinUtils
  COIN-OR Utilities
  ☆48Updated 2 months ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆78Updated 6 years ago
• nojhan / paradiseo
  An evolutionary computation framework to (automatically) build fast parallel stochastic optimization solvers
  ☆105Updated last week
• chengengjie / delaunay-triangulation
  Delaunay Triangulation
  ☆9Updated 5 years ago
• lingz / LK-Heuristic
  Lin-Kernighan Heuristic Implementation for TSP
  ☆31Updated 10 years ago
• matthelb / concorde
  Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. It was cre…
  ☆91Updated 3 years ago
• PavelTrutman / polyopt
  Polynomial optimization problem solver. Uses relaxation to convert the problem into Semidefinite programming. Can be also used just as Se…
  ☆20Updated 7 years ago
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆140Updated 2 weeks ago
• coin-or / Osi
  Open Solver Interface
  ☆57Updated 4 months ago
• coin-or / Csdp
  This is the working repository for the CSDP project. CSDP is a solver for semidefinite programming problems. It is a COIN-OR project.
  ☆58Updated 2 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated 2 months ago