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.
☆105Updated 4 years ago
Alternatives and similar repositories for concorde
Users that are interested in concorde are comparing it to the libraries listed below
Sorting:
- A harness for building the bundled suite of interoperable optimization tools available in the COIN-OR repository.☆135Updated 4 years ago
- An evolutionary computation framework to (automatically) build fast parallel stochastic optimization solvers☆118Updated 8 months ago
- Sequential object-oriented simPlex☆73Updated last week
- Branch-Cut-Price Framework☆31Updated 5 years ago
- Parallel Presolve for Integer and Linear Optimization☆40Updated 4 years ago
- C++ metaheuristics modeler/solver for general integer optimization problems.☆52Updated 2 weeks ago
- OptFrame - C++17/C++20/C++23 Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆90Updated 3 months ago
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆26Updated 3 years ago
- Mathematical Modeling for Optimization and Machine Learning☆156Updated 3 months ago
- Parallel Presolve for Integer and Linear Optimization☆82Updated this week
- SCIP - Solving Constraint Integer Programs☆551Updated this week
- Python wrapper around the Concorde TSP solver☆391Updated 9 months ago
- COIN-OR Linear Programming Solver☆479Updated this week
- A solver for mixed-integer nonlinear optimization problems☆127Updated last week
- A state-of-the-art inexact solver for the Traveling Salesman problem (TSP).☆28Updated 5 years ago
- Genetic algorithm for Traveling salesman problem☆54Updated 4 years ago
- Library for working with TSPLIB files.☆81Updated 2 years ago
- A Library of Optimization Problem Libraries☆50Updated 4 years ago
- A standalone local search solver for general integer linear programming☆16Updated last year
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆35Updated 8 months ago
- Discrete Optimization is a python library to ease the definition and re-use of discrete optimization problems and solvers.☆76Updated this week
- Open Solver Interface☆62Updated this week
- Visualizations of Mittelmann benchmarks☆64Updated last week
- Fork of the Concorde TSP solver with an easier build procedure☆15Updated last year
- Original high performance simplex solver of Qi Huangfu☆12Updated 7 years ago
- A C++ Framework for Optimization☆36Updated 3 weeks ago
- Python-MIP: collection of Python tools for the modeling and solution of Mixed-Integer Linear programs☆581Updated 4 months ago
- Minotaur Toolkit for Mixed-Integer Nonlinear Optimization☆80Updated last week
- Github mirror of Keld Helsgaun's wonderful LKH3 project.☆30Updated 5 years ago
- A parallel branch-and-bound engine for Python. (https://pybnb.readthedocs.io/)☆67Updated 4 years ago