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…
  ☆93Updated 3 years ago
• pandrey-fr / maxcut
  Python implementation of various max-cut problem solvers.
  ☆20Updated 6 years ago
• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated 11 months ago
• ntnu-arl / LKH_TSP
  A set of tools to solve TSP problems using the LKH solver
  ☆97Updated 9 years ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆76Updated 2 months ago
• jwalteros / dOmega
  Library for finding maximum cliques on graphs
  ☆15Updated 3 years ago
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆29Updated last month
• kittobi1992 / cluster_editing
  KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…
  ☆10Updated 2 years ago
• cerebis / LKH3
  Github mirror of Keld Helsgaun's wonderful LKH3 project.
  ☆27Updated 4 years ago
• c4v4 / LKH-SP
  Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.
  ☆11Updated 3 years ago
• heldstephan / exactcolors
  Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.
  ☆13Updated 2 years ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• laser-ufpb / CVRPController
  CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.
  ☆22Updated 3 years ago
• optframe / optframe
  OptFrame - C++17 (and C++20) Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…
  ☆83Updated this week
• algorithms-with-predictions / algorithms-with-predictions.github.io
  Overview website for research on Algorithms with Predictions (ALPS)
  ☆41Updated this week
• CharJon / GeCO
  Generators for Combinatorial Optimization
  ☆18Updated 2 years ago
• fontanf / roadef2018
  Team J28 submission for the ROADEF/EURO Challenge 2018
  ☆12Updated 5 years ago
• renault-iaa / challenge-roadef-2022
  challenge EURO/ROADEF 2022 on RENAULT's truck loading : documents and issues
  ☆29Updated last year
• mareksubocz / QuantumJSP
  A heuristic approach on how to optimally schedule jobs using D-Wave's quantum computer
  ☆24Updated last year
• darrenstrash / open-mcs
  An open implementation of the MC family of maximum clique algorithms
  ☆12Updated 8 years ago
• lingz / LK-Heuristic
  Lin-Kernighan Heuristic Implementation for TSP
  ☆31Updated 10 years ago
• wata-orz / steiner_tree
  Steiner tree solver
  ☆30Updated 7 years ago
• alberto-santini / concorde-easy-build
  Fork of the Concorde TSP solver with an easier build procedure
  ☆14Updated last year
• fontanf / columngenerationsolver
  A solver based on column generation
  ☆30Updated last month
• dparo / master-thesis
  A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
  ☆16Updated last year
• sassoftware / cvrpsep
  The CVRPSEP package is a collection of routines, written in the C++ programming language, for separation of various classes of cuts in br…
  ☆21Updated 10 months ago
• dRehfeldt / SCIPJack-Steiner-tree-solver
  Very fast, exact Steiner tree solver
  ☆16Updated 3 years ago
• ciaranm / glasgow-subgraph-solver
  A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.
  ☆81Updated last week
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆116Updated last year
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated 3 weeks ago