swMATH4770MaRDI QIDQ16936FDOQ16936
Author name not available (Why is that?)
Official website: http://www.math.uwaterloo.ca/tsp/concorde.html
Source code repository: https://github.com/jvkersch/pyconcorde
Cited In (only showing first 100 items - show all)
- Compact formulations of the Steiner traveling salesman problem and related problems
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
- The salesman and the tree: the importance of search in CP
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- Improved filtering for weighted circuit constraints
- Algorithm runtime prediction: methods \& evaluation
- George Dantzig's contributions to integer programming
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms
- On interior-point warmstarts for linear and combinatorial optimization
- Generating partitions of a graph into a fixed number of minimum weight cuts
- Exact algorithms for routing problems under vehicle capacity constraints
- ALPS
- GILK
- SNDlib
- SCIL
- TSPLIB
- VRPH
- ZRAM
- BIANCA
- PICO
- SALSA
- ABACUS
- BoneRoute
- MINTO
- Blossom V
- LKH
- QSopt_ex
- QUALEX
- PORTA
- BonsaiG
- BG-WalkSAT
- TSPTW
- SYMPHONY
- LEMON
- TSP software
- QSopt-Exact
- VRP
- METSlib
- BiCePS
- Cardinal
- libcgrpp
- PLplot
- SimCList
- seriation
- SDP_S
- RAPTOR
- FANT
- Sbmltoolbox
- CVRPSEP
- COIN/BCP
- OsiSolver
- LOLIB
- minFunc
- CVRPSP
- GTSP Instances Library
- CABOB
- TSP
- GAP
- GSGP
- pPCx
- VIPR
- HAS-QAP
- bc-opt
- flacco
- Localizer
- Bob++
- PermutMatrix
- GTSP-LIB
- math.js
- IntraClusTSP
- asm.js
- GAPJS
- glpk.js
- jsLPSolver
- node-lp_solve
- Numericjs
- spatiasql.js
- SpatiaLite
- three.js
- MOrepo
- MATILDA
- A library of local search heuristics for the vehicle routing problem
- Dividing a territory among several vehicles
- A concise guide to the Traveling Salesman Problem
- The Travelling Salesman Problem in Bounded Degree Graphs
- A library hierarchy for implementing scalable parallel search algorithms
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- Integer linear programming for the Bayesian network structure learning problem
- BPPLIB: a library for bin packing and cutting stock problems
- Client-side computational optimization
- Bilevel programming and the separation problem
- Lifting and separation procedures for the cut polytope
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
This page was built for software: Concorde
