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

• matthelb / concorde
  Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. It was cre…
  ☆95Updated 3 years ago
• coin-or / Clp
  COIN-OR Linear Programming Solver
  ☆453Updated 2 weeks ago
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆116Updated last year
• wata-orz / steiner_tree
  Steiner tree solver
  ☆30Updated 7 years ago
• rahulyesantharao / batch-dynamic-kdtree
  Parallel, batch-dynamic kdtree
  ☆13Updated 3 years ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆19Updated 2 years ago
• scipopt / SCIPpp
  A C++ wrapper for SCIP
  ☆24Updated 6 months ago
• AndrewB330 / EuclideanMST
  Implementations of different algorithms for building Euclidean minimum spanning tree in k-dimensional space.
  ☆22Updated 4 years ago
• pandrey-fr / maxcut
  Python implementation of various max-cut problem solvers.
  ☆20Updated 6 years ago
• ParAlg / ParGeo
  ☆47Updated 2 years ago
• scipopt / soplex
  Sequential object-oriented simPlex
  ☆68Updated last week
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆80Updated 6 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆443Updated 3 months ago
• patmjen / maxflow_algorithms
  A collection of min-cut/max-flow algorithms.
  ☆48Updated 3 years ago
• VieCut / VieCut
  VieCut 1.00 - Shared-memory Minimum Cuts
  ☆45Updated 2 years ago
• LPMP / BDD
  An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…
  ☆59Updated last year
• kahypar / kahypar
  KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…
  ☆480Updated 3 weeks ago
• KRM7 / gapp
  A genetic algorithms library in C++ for single- and multi-objective optimization.
  ☆37Updated this week
• tpet / lemon
  LEMON Graph Library
  ☆43Updated 5 years ago
• sergiud / SuiteSparse
  SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support
  ☆53Updated last month
• cchatzis / Nearest-Neighbour-LSH
  C++ program that, given a vectorised dataset and query set, performs locality sensitive hashing, finding either Nearest Neighbour (NN) or…
  ☆11Updated 3 years ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆78Updated 3 weeks ago
• scipopt / scip
  SCIP - Solving Constraint Integer Programs
  ☆490Updated this week
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆149Updated last week
• facebookresearch / baspacho
  Direct solver for sparse SPD matrices for nonlinear optimization. Implements supernodal Cholesky decomposition algorithm, and supports GP…
  ☆91Updated 2 months ago
• ntnu-arl / LKH_TSP
  A set of tools to solve TSP problems using the LKH solver
  ☆98Updated 9 years ago
• bolner / SimplexSolver
  An easy-to-use Simplex solver class for linear programming.
  ☆20Updated 7 years ago
• gnardari / wasserstein
  Header only C++ implementation of the Wasserstein distance (or earth mover's distance)
  ☆13Updated 4 years ago
• jonathanventura / polynomial
  Templated C++ polynomial library
  ☆25Updated 2 years ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆56Updated 2 years ago