matthelb / concorde
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.
☆91Updated 3 years ago
Alternatives and similar repositories for concorde
Users that are interested in concorde are comparing it to the libraries listed below
Sorting:
- Branch-Cut-Price Framework☆29Updated 4 years ago
- Parallel Presolve for Integer and Linear Optimization☆71Updated last week
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆141Updated 4 months ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆29Updated 3 weeks ago
- Python/Numba implemenation of of Lin-Kernighan-style TSP solver☆19Updated 4 years ago
- Sequential object-oriented simPlex☆64Updated 3 weeks ago
- Parallel Presolve for Integer and Linear Optimization☆40Updated 3 years ago
- A standalone local search solver for general integer linear programming☆16Updated 10 months ago
- A set of tools to solve TSP problems using the LKH solver☆96Updated 9 years ago
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 3 years ago
- binary/integer linear programming solver☆16Updated 5 months ago
- A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#☆85Updated 11 months ago
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆48Updated last year
- Library for working with TSPLIB files.☆74Updated last year
- A state-of-the-art inexact solver for the Traveling Salesman problem (TSP).☆27Updated 4 years ago
- A harness for building the bundled suite of interoperable optimization tools available in the COIN-OR repository.☆128Updated 3 years ago
- Genetic algorithm for Traveling salesman problem☆51Updated 3 years ago
- A solver based on column generation☆30Updated last week
- DIP is a decomposition-based solver framework for mixed integer linear programs.☆19Updated 4 years ago
- Decomposition Strategies for Vehicle Routing Heuristics☆29Updated last year
- A C++ Framework for Optimization☆34Updated this week
- C++ metaheuristics modeler/solver for general integer optimization problems.☆50Updated last week
- challenge EURO/ROADEF 2022 on RENAULT's truck loading : documents and issues☆29Updated last year
- Python wrapper around the Concorde TSP solver☆370Updated last month
- Quickstart for EURO Meets NeurIPS 2022 Vehicle Routing Competition☆96Updated 2 years ago
- Open Solver Interface☆57Updated 5 months ago
- Cut Generator Library☆27Updated 2 weeks ago
- Fork of the Concorde TSP solver with an easier build procedure☆14Updated last year
- A parallel branch-and-bound engine for Python. (https://pybnb.readthedocs.io/)☆68Updated 3 years ago
- Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem☆90Updated 4 years ago