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.
☆109Dec 20, 2021Updated 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 state-of-the-art inexact solver for the Traveling Salesman problem (TSP).☆28Nov 21, 2020Updated 5 years ago
- Fork of the Concorde TSP solver with an easier build procedure☆15Mar 17, 2024Updated 2 years ago
- Tabu Search heuristic for Travelling Salesperson Problems with Profits☆11Oct 16, 2018Updated 7 years ago
- metaheuristics for traveling salesman problem (TSP)☆20Aug 3, 2023Updated 2 years ago
- Python wrapper around the Concorde TSP solver☆394Mar 9, 2026Updated last week
- ☆24Mar 12, 2025Updated last year
- binary/integer linear programming solver☆17Nov 25, 2024Updated last year
- C++ metaheuristics modeler/solver for general integer optimization problems.☆53Jan 24, 2026Updated last month
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem☆29Jun 13, 2025Updated 9 months ago
- meta-heuristics solver for easy modeling☆29Oct 17, 2022Updated 3 years ago
- Yet another alternative curriculum vitae/résumé class with LaTeX☆11May 7, 2020Updated 5 years ago
- Github mirror of Keld Helsgaun's wonderful LKH3 project.☆30Oct 4, 2020Updated 5 years ago
- A standalone local search solver for general integer linear programming☆16Jul 8, 2024Updated last year
- Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem☆47Jan 26, 2024Updated 2 years ago
- Instances for the Pickup and Delivery Problem with Time Windows (PDPTW) based on open data☆57Jul 12, 2025Updated 8 months ago
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆165Jan 22, 2026Updated last month
- Solve optimization problems and build custom algorithms☆38Mar 6, 2026Updated 2 weeks ago
- A solver for the (unicost) set covering problem☆23Dec 21, 2025Updated 2 months ago
- A Julia wrapper for the Lin-Kernighan-Helsgaun (LKH) solver.☆18Mar 15, 2023Updated 3 years ago
- Algorithms for the Orienteering Problem☆41Apr 29, 2025Updated 10 months ago
- Python version of FastPM☆12Jul 20, 2020Updated 5 years ago
- Julia Package for reading location problems data files☆14May 17, 2023Updated 2 years ago
- A dataset of hard problem instances for the 0-1 knapsack problem☆21Feb 5, 2024Updated 2 years ago
- A chess engine designed to fit into 4kb☆12Updated this week
- This tool visualizes solutions for the Vehicle Routing Problem combined with the 3D Container Loading Problem.☆14Nov 8, 2022Updated 3 years ago
- Examples from Intel Fortran coarray tutorial☆14May 24, 2021Updated 4 years ago
- A set of tools to solve TSP problems using the LKH solver☆101Nov 8, 2015Updated 10 years ago
- quaprogIP solver for Non-Convex quadratic programs☆11Jun 28, 2019Updated 6 years ago
- AWS Last Mile Route Sequence Optimization☆76Jan 13, 2026Updated 2 months ago
- ☆91Mar 9, 2026Updated last week
- Discorde TSP is an easy-to-use API for Concorde TSP solver in C and C++ programming languages☆20Oct 8, 2018Updated 7 years ago
- A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.☆285Dec 2, 2023Updated 2 years ago
- An open source multi-solver optimization server with a REST API.☆21Updated this week
- TeX/LaTeXの知識を共有するためのリポジトリ。9割LaTeX☆26Oct 10, 2018Updated 7 years ago
- Solomon benchmark instances☆33Feb 5, 2022Updated 4 years ago
- Official implementation of H-TSP (AAAI2023)☆56Mar 21, 2025Updated 11 months ago
- Decomposition Strategies for Vehicle Routing Heuristics☆32Nov 25, 2023Updated 2 years ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆35Apr 15, 2025Updated 11 months ago
- public-domain base64 implementation☆16Nov 18, 2021Updated 4 years ago