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.
☆114Dec 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Repository of symmetric TSP data☆118Apr 12, 2017Updated 9 years ago
- Fork of the Concorde TSP solver with an easier build procedure☆15Mar 17, 2024Updated 2 years ago
- Github mirror of Keld Helsgaun's wonderful LKH3 project.☆34Oct 4, 2020Updated 6 years ago
- Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem☆47Jan 26, 2024Updated 2 years ago
- Hill-Valley Evolutionary Algorithm (GECCO2018)☆10Aug 12, 2019Updated 7 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- metaheuristics for traveling salesman problem (TSP)☆20Aug 3, 2023Updated 3 years ago
- Code for SIGKDD2025 paper: An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem☆16Jan 28, 2025Updated last year
- Set of Lecture at Duke in 2018 by Lenka Zdeborova and Florent Krzakala "Statistical Physics For Optimization and Learning"☆17Dec 22, 2019Updated 6 years ago
- Algorithms, codes and results from master's thesis☆15Jun 6, 2022Updated 4 years ago
- Very small and simple parser for CPLEX LP files into logical Python data structures☆11Dec 20, 2012Updated 13 years ago
- binary/integer linear programming solver☆17Updated this week
- C++ metaheuristics modeler/solver for general integer optimization problems.☆55Oct 14, 2026Updated last month
- a collection of benchmarks (in DIMACS format) for various NP-Complete problems☆16Sep 17, 2026Updated 2 months ago
- ☆28Sep 28, 2026Updated last month
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆12Jan 31, 2022Updated 4 years ago
- ☆28Mar 10, 2026Updated 8 months ago
- This code is to solve traveling salesman problem by using simulated annealing meta heuristic.☆32Jan 11, 2018Updated 8 years ago
- Sequential object-oriented simPlex☆89Updated this week
- Header-only C++23 bucket graph labeling for the SPPRC — the pricing subproblem in vehicle routing column generation☆31Updated this week
- Time series with torch☆13Jun 18, 2022Updated 4 years ago
- Manage multiple OpenAI Codex CLI accounts — profile switching, rate limit dashboard, shell completions☆15Oct 21, 2026Updated 3 weeks ago
- Genetic algorithm for Traveling salesman problem☆57Jun 19, 2021Updated 5 years ago
- This tool visualizes solutions for the Vehicle Routing Problem combined with the 3D Container Loading Problem.☆14Nov 8, 2022Updated 4 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- ☆13Aug 3, 2026Updated 3 months ago
- A portable, header-only SIMD library for C (SSE2, SSE4.1, AVX/AVX2+FMA, NEON/AArch64, WebAssembly SIMD128, scalar fallback)☆16Apr 1, 2026Updated 7 months ago
- Scheduling maneuvers for the restoration of electric power distribution networks☆10Nov 21, 2022Updated 3 years ago
- Official repository for the TMLR paper "Self-Improvement for Neural Combinatorial Optimization: Sample Without Replacement, but Improveme…☆33Jan 22, 2026Updated 9 months ago
- ☆13Apr 23, 2026Updated 6 months ago
- ☆20Jan 30, 2020Updated 6 years ago
- ☆12Aug 2, 2023Updated 3 years ago
- Library for working with TSPLIB files.☆84Jan 9, 2024Updated 2 years ago
- A set of tools to solve TSP problems using the LKH solver☆102Nov 8, 2015Updated 11 years ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- A solver for the (unicost) set covering problem☆25Oct 31, 2026Updated 2 weeks ago
- Solomon benchmark instances☆36Feb 5, 2022Updated 4 years ago
- TeX/LaTeXの知識を共有するためのリポジトリ。9割LaTeX☆26Oct 10, 2018Updated 8 years ago
- A solver based on column generation☆45Updated this week
- A simple gitlab ci image with all required dependencies for building java hipster. Caching must be done with gitlab ci☆11Feb 5, 2017Updated 9 years ago
- Cross-entropy method variants for optimization in Julia☆13Apr 29, 2021Updated 5 years ago
- A dataset of hard problem instances for the 0-1 knapsack problem☆23Feb 5, 2024Updated 2 years ago
Are these results useful?