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.
☆85Updated 3 years ago
Alternatives and similar repositories for concorde:
Users that are interested in concorde are comparing it to the libraries listed below
- Branch-Cut-Price Framework☆28Updated 4 years ago
- A Library of Optimization Problem Libraries☆49Updated 3 years ago
- Library for working with TSPLIB files.☆73Updated last year
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 3 years ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆25Updated 2 years ago
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆129Updated last month
- Python/Numba implemenation of of Lin-Kernighan-style TSP solver☆18Updated 4 years ago
- A harness for building the bundled suite of interoperable optimization tools available in the COIN-OR repository.☆123Updated 3 years ago
- challenge EURO/ROADEF 2022 on RENAULT's truck loading : documents and issues☆29Updated last year
- Python wrapper around the Concorde TSP solver☆354Updated 8 months ago
- A set of tools to solve TSP problems using the LKH solver☆90Updated 9 years ago
- A standalone local search solver for general integer linear programming☆16Updated 6 months ago
- Framework for solving discrete optimization problems using a combination of Mixed-Integer Linear Programming (MIP) and Machine Learning (…☆159Updated last month
- A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#☆81Updated 7 months ago
- A parallel branch-and-bound engine for Python. (https://pybnb.readthedocs.io/)☆68Updated 3 years ago
- Parallel Presolve for Integer and Linear Optimization☆67Updated 2 weeks ago
- A Python wrapper for the Hybrid Genetic Search algorithm for Capacitated Vehicle Routing Problems (HGS-CVRP)☆86Updated last year
- Visualizations of Mittelmann benchmarks☆57Updated 4 months ago
- DIP is a decomposition-based solver framework for mixed integer linear programs.☆19Updated 4 years ago
- Quickstart for EURO Meets NeurIPS 2022 Vehicle Routing Competition☆88Updated last year
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆45Updated last year
- Presentation: Custom MIP Heuristics☆33Updated 3 years ago
- Python package to read and write vehicle routing problem instances.☆96Updated 3 months ago
- OptFrame - C++17 (and C++20) Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆75Updated 7 months ago
- Fork of the Concorde TSP solver with an easier build procedure☆12Updated 10 months ago
- A solver for mixed-integer nonlinear optimization problems☆119Updated 2 weeks ago
- Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem☆83Updated 4 years ago
- A solver based on column generation☆26Updated this week
- A python framework for solving the VRP and its variants with column generation.☆186Updated last year
- Code for solving LP on GPU using first-order methods☆167Updated last month