matthelb / concordeLinks
Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. It was created by David Applegate, Robert E. Bixby, Vašek Chvátal, and William J. Cook.
☆103Updated 3 years ago
Alternatives and similar repositories for concorde
Users that are interested in concorde are comparing it to the libraries listed below
Sorting:
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 3 years ago
- Parallel Presolve for Integer and Linear Optimization☆76Updated this week
- A harness for building the bundled suite of interoperable optimization tools available in the COIN-OR repository.☆132Updated 4 years ago
- An evolutionary computation framework to (automatically) build fast parallel stochastic optimization solvers☆117Updated 7 months ago
- A standalone local search solver for general integer linear programming☆16Updated last year
- OptFrame - C++17/C++20/C++23 Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆89Updated 2 months ago
- Branch-Cut-Price Framework☆30Updated 5 years ago
- Sequential object-oriented simPlex☆70Updated last week
- C++ metaheuristics modeler/solver for general integer optimization problems.☆52Updated last month
- A C++ Framework for Optimization☆36Updated this week
- A Library of Optimization Problem Libraries☆49Updated 3 years ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆34Updated 7 months ago
- A solver based on column generation☆35Updated last month
- Parallel Presolve for Integer and Linear Optimization☆40Updated 4 years ago
- Python wrapper around the Concorde TSP solver☆387Updated 7 months ago
- A solver for mixed integer bilevel programs☆56Updated 4 months ago
- Visualizations of Mittelmann benchmarks☆62Updated last week
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆157Updated last month
- A standalone local search solver for general mixed integer programming☆31Updated this week
- COIN-OR Linear Programming Solver☆470Updated 2 weeks ago
- Genetic algorithm for Traveling salesman problem☆54Updated 4 years ago
- Mathematical Modeling for Optimization and Machine Learning☆156Updated last month
- Feasibility Pump Collection☆16Updated 2 years ago
- SCIP - Solving Constraint Integer Programs☆524Updated this week
- Basic Open-source Nonlinear Mixed INteger programming☆141Updated last year
- A state-of-the-art inexact solver for the Traveling Salesman problem (TSP).☆28Updated 5 years ago
- Nutmeg – a MIP and CP branch-and-check solver☆30Updated 2 years ago
- Fork of the Concorde TSP solver with an easier build procedure☆15Updated last year
- A solver for mixed-integer nonlinear optimization problems☆127Updated 3 months ago
- A genetic algorithm using Edge Assembly Crossover for the traveling salesman problem☆37Updated 3 years ago