Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. The code is written in the ANSI C programming language and it is available for academic research use; for other uses, contact William Cook for licensing options. Concorde’s TSP solver has been used to obtain the optimal solutions to 106 of the 110 TSPLIB instances; the largest having 85,900 cities. The Concorde callable library includes over 700 functions permitting users to create specialized codes for TSP-like problems. All Concorde functions are thread-safe for programming in shared-memory parallel environments; the main TSP solver includes code for running over networks of UNIX workstations.

References in zbMATH (referenced in 165 articles , 1 standard article )

Showing results 1 to 20 of 165.
Sorted by year (citations)

1 2 3 ... 7 8 9 next

  1. Vanneschi, Leonardo: An introduction to geometric semantic genetic programming (2017)
  2. Bartal, Yair; Gottlieb, Lee-Ad; Krauthgamer, Robert: The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (2016)
  3. Braun, Gábor; Pokutta, Sebastian: A polyhedral characterization of border bases (2016)
  4. Fages, Jean-Guillaume; Lorca, Xavier; Rousseau, Louis-Martin: The salesman and the tree: the importance of search in CP (2016)
  5. Fischer, Anja: A polyhedral study of the quadratic traveling salesman problem (2016)
  6. Klaučo, Martin; Blažek, Slavomír; Kvasnica, Michal: An optimal path planning problem for heterogeneous multi-vehicle systems (2016)
  7. Megow, Nicole; Skutella, Martin; Verschae, José; Wiese, Andreas: The power of recourse for online MST and TSP (2016)
  8. Rendl, F.: Semidefinite relaxations for partitioning, assignment and ordering problems (2016)
  9. Seth, Anupam; Klabjan, Diego; Ferreira, Placid M.: A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines (2016)
  10. Vaksman, Gregory; Zibulevsky, Michael; Elad, Michael: Patch ordering as a regularization for inverse problems in image processing (2016)
  11. Vasilyev, Igor; Boccia, Maurizio; Hanafi, Saïd: An implementation of exact knapsack separation (2016)
  12. Weise, Thomas; Wu, Yuezhong; Chiong, Raymond; Tang, Ke; Lässig, Jörg: Global versus local search: the impact of population sizes on evolutionary algorithm performance (2016)
  13. Adulyasak, Yossiri; Cordeau, Jean-François; Jans, Raf: Benders decomposition for production routing under demand uncertainty (2015)
  14. Bouzid, Mouaouia Cherif: Splitting a giant tour using integer linear programming (2015)
  15. Castro, Marco; Sörensen, Kenneth; Vansteenwegen, Pieter; Goos, Peter: A fast metaheuristic for the travelling salesperson problem with hotel selection (2015)
  16. Gendreau, Michel; Nossack, Jenny; Pesch, Erwin: Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (2015)
  17. Hoos, Holger H.; Stützle, Thomas: On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (2015)
  18. Hungerländer, P.: A semidefinite optimization approach to the target visitation problem (2015)
  19. Martinelli, Rafael; Contardo, Claudio: Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (2015)
  20. Mason, Luke R.; Mak-Hau, Vicky H.; Ernst, Andreas T.: A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning (2015)

1 2 3 ... 7 8 9 next