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.
☆80Updated 2 years ago
Related projects: ⓘ
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 2 years ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆24Updated 2 years ago
- Branch-Cut-Price Framework☆26Updated 4 years ago
- Parallel Presolve for Integer and Linear Optimization☆38Updated 3 years ago
- A standalone local search solver for general integer linear programming☆15Updated 2 months ago
- OptFrame - C++17 (and C++20) Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆70Updated 3 months ago
- A state-of-the-art inexact solver for the Traveling Salesman problem (TSP).☆25Updated 3 years ago
- A Library of Optimization Problem Libraries☆48Updated 2 years ago
- A harness for building the bundled suite of interoperable optimization tools available in the COIN-OR repository.☆116Updated 3 years ago
- An evolutionary computation framework to (automatically) build fast parallel stochastic optimization solvers☆96Updated last week
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆113Updated last week
- Genetic algorithm for Traveling salesman problem☆49Updated 3 years ago
- A Python library for visualizing algorithms for solving mathematical optimization problems.☆63Updated 3 years ago
- A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#☆77Updated 3 months ago
- Fork of the Concorde TSP solver with an easier build procedure☆11Updated 6 months ago
- DIP is a decomposition-based solver framework for mixed integer linear programs.☆17Updated 3 years ago
- Presentation: Custom MIP Heuristics☆32Updated 2 years ago
- Sequential object-oriented simPlex☆59Updated last week
- A solver based on column generation☆22Updated 2 weeks ago
- Visualizations of Mittelmann benchmarks☆53Updated this week
- Cut Generator Library☆24Updated this week
- A solver for mixed integer bilevel programs☆50Updated last week
- A Python wrapper for the Hybrid Genetic Search algorithm for Capacitated Vehicle Routing Problems (HGS-CVRP)☆79Updated last year
- Parallel Presolve for Integer and Linear Optimization☆62Updated this week
- Branch-and-Price-and-Cut in Julia☆193Updated 6 months ago
- C++ metaheuristics modeler/solver for general integer optimization problems.☆45Updated last month
- Nutmeg – a MIP and CP branch-and-check solver☆22Updated last year
- Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…☆16Updated last year
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆41Updated last year
- The Mathematical Optimization Framework☆24Updated 2 weeks ago