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.
☆81Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for concorde
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆25Updated 2 years ago
- A standalone local search solver for general integer linear programming☆15Updated 4 months ago
- Python wrapper around the Concorde TSP solver☆349Updated 6 months ago
- Library for working with TSPLIB files.☆70Updated 10 months ago
- A Library of Optimization Problem Libraries☆49Updated 2 years ago
- A harness for building the bundled suite of interoperable optimization tools available in the COIN-OR repository.☆118Updated 3 years ago
- Branch-Cut-Price Framework☆27Updated 4 years ago
- Genetic algorithm for Traveling salesman problem☆49Updated 3 years ago
- Fork of the Concorde TSP solver with an easier build procedure☆11Updated 8 months ago
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆122Updated 2 months ago
- OptFrame - C++17 (and C++20) Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆71Updated 5 months ago
- challenge EURO/ROADEF 2022 on RENAULT's truck loading : documents and issues☆29Updated last year
- A state-of-the-art inexact solver for the Traveling Salesman problem (TSP).☆25Updated 4 years ago
- Parallel Presolve for Integer and Linear Optimization☆39Updated 3 years ago
- A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#☆80Updated 5 months ago
- A solver based on column generation☆24Updated last week
- An evolutionary computation framework to (automatically) build fast parallel stochastic optimization solvers☆98Updated last month
- Visualizations of Mittelmann benchmarks☆55Updated 2 months ago
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 2 years ago
- Python/Numba implemenation of of Lin-Kernighan-style TSP solver☆18Updated 4 years ago
- Parallel Presolve for Integer and Linear Optimization☆64Updated this week
- A set of tools to solve TSP problems using the LKH solver☆89Updated 9 years ago
- Domain-Independent Dynamic Programming (DIDP) framework implemented in Rust.☆27Updated 5 months ago
- C++ metaheuristics modeler/solver for general integer optimization problems.☆45Updated this week
- Discrete Optimization is a python library to ease the definition and re-use of discrete optimization problems and solvers.☆42Updated 3 weeks ago
- Decomposition Strategies for Vehicle Routing Heuristics☆25Updated 11 months ago
- A Python library for visualizing algorithms for solving mathematical optimization problems.☆64Updated 3 years ago
- Presentation: Custom MIP Heuristics☆32Updated 3 years ago
- Sequential object-oriented simPlex☆61Updated last week
- A standalone local search solver for general mixed integer programming☆13Updated 3 months ago