Concorde

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 218 articles , 1 standard article )

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

1 2 3 ... 9 10 11 next

  1. Álvarez-Miranda, Eduardo; Luipersbeck, Martin; Sinnl, Markus: Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (2018)
  2. Burger, M.; Su, Z.; De Schutter, B.: A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (2018)
  3. Lahyani, Rahma; Coelho, Leandro C.; Renaud, Jacques: Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (2018)
  4. Lancia, Giuseppe; Serafini, Paolo: Compact extended linear programming models (2018)
  5. Bartlett, Mark; Cussens, James: Integer linear programming for the Bayesian network structure learning problem (2017)
  6. Bliznets, Ivan; Fomin, Fedor V.; Golovach, Petr A.; Karpov, Nikolay; Kulikov, Alexander S.; Saurabh, Saket: Parameterized complexity of superstring problems (2017)
  7. Borst, Sem; Bradonjić, Milan: Scaling laws for maximum coloring of random geometric graphs (2017)
  8. Burke, Edmund K.; Bykov, Yuri: The late acceptance hill-climbing heuristic (2017)
  9. Daoud, S.N.: Complexity of graphs generated by wheel graph and their asymptotic limits (2017)
  10. Dokka, Trivikram; Mourtos, Ioannis; Spieksma, Frits C.R.: Fast separation for the three-index assignment problem (2017)
  11. Fischer, Anja; Hungerländer, Philipp: The traveling salesman problem on grids with forbidden neighborhoods (2017)
  12. Fotakis, Dimitris; Gourvès, Laurent; Monnot, Jér^ome: Selfish transportation games (2017)
  13. Franceschetti, Anna; Jabali, Ola; Laporte, Gilbert: Continuous approximation models in freight distribution management (2017)
  14. Gleixner, Ambros M.; Berthold, Timo; Müller, Benjamin; Weltge, Stefan: Three enhancements for optimization-based bound tightening (2017)
  15. Gouveia, Luis; Leitner, Markus; Ruthmair, Mario: Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (2017)
  16. Hungerländer, Philipp: New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (2017)
  17. Lodi, Andrea; Zarpellon, Giulia: On learning and branching: a survey (2017)
  18. Mohan, Usha; Ramani, Sivaramakrishnan; Mishra, Sounaka: Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (2017)
  19. Niel, Blanca Isabel: Winding indexes of Max. and Min. Hamiltonians in $N$-gons (2017)
  20. Oswin, Aichholzer; Fischer, Anja; Fischer, Frank; Meier, J.Fabian; Pferschy, Ulrich; Pilz, Alexander; Staněk, Rostislav: Minimization and maximization versions of the quadratic travelling salesman problem (2017)

1 2 3 ... 9 10 11 next