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

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

1 2 3 ... 12 13 14 next

  1. Date, Prasanna; Patton, Robert; Schuman, Catherine; Potok, Thomas: Efficiently embedding QUBO problems on adiabatic quantum computers (2019)
  2. Kieu, Tien D.: The travelling salesman problem and adiabatic quantum computation: an algorithm (2019)
  3. Nowak, Maciek; Hewitt, Mike; Bachour, Hussam: Mileage bands in freight transportation (2019)
  4. Taillard, Éric D.; Helsgaun, Keld: POPMUSIC for the travelling salesman problem (2019)
  5. Toffolo, Túlio A. M.; Vidal, Thibaut; Wauters, Tony: Heuristics for vehicle routing problems: sequence or set optimization? (2019)
  6. Álvarez-Miranda, Eduardo; Luipersbeck, Martin; Sinnl, Markus: Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (2018)
  7. Avis, David; Jordan, Charles: \textttmplrs: a scalable parallel vertex/facet enumeration code (2018)
  8. Burger, M.; Su, Z.; De Schutter, B.: A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (2018)
  9. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  10. Diamond, S.; Takapoui, R.; Boyd, S.: A general system for heuristic minimization of convex functions over non-convex sets (2018)
  11. Domínguez-Martín, Bencomo; Rodríguez-Martín, Inmaculada; Salazar-González, Juan-José: The driver and vehicle routing problem (2018)
  12. Dulai, Tibor; Werner-Stark, Ágnes; Hangos, Katalin Mária: Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance (2018)
  13. Ferrer, José M.; Martín-Campo, F. Javier; Ortuño, M. Teresa; Pedraza-Martínez, Alfonso J.; Tirado, Gregorio; Vitoriano, Begoña: Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications (2018)
  14. Gao, Zhihan: On the metric (s)-(t) path traveling salesman problem (2018)
  15. Glynn, David; Haythorpe, Michael; Moeini, Asghar: Directed in-out graphs of optimal size (2018)
  16. Hu, Hao; Li, Jian; Li, Xiang: A credibilistic goal programming model for inventory routing problem with hazardous materials (2018)
  17. Klapp, Mathias A.; Erera, Alan L.; Toriello, Alejandro: The dynamic dispatch waves problem for same-day delivery (2018)
  18. Kobeaga, Gorka; Merino, María; Lozano, Jose A.: An efficient evolutionary algorithm for the orienteering problem (2018)
  19. Kumar, Santosh; Munapo, Elias; Lesaoana, ’Maseka; Nyamugure, Philimon: A minimum spanning tree based heuristic for the travelling salesman tour (2018)
  20. Lahyani, Rahma; Coelho, Leandro C.; Renaud, Jacques: Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (2018)

1 2 3 ... 12 13 14 next