TSPLIB

TSPLIB is a library of sample instances for the TSP (and related problem) from various sources and of various types. Instances of the following problem classes are available. Symmetric traveling salesman problem (TSP) Hamiltonian cycle problem (HCP) Asymmetric traveling salesman problem (ATSP) Sequential ordering problem (SOP) Capacitated vehicle routing problem (CVRP)


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

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

1 2 3 ... 31 32 33 next

  1. Archetti, C.; Feillet, D.; Mor, A.; Speranza, M. G.: Dynamic traveling salesman problem with stochastic release dates (2020)
  2. Cacchiani, Valentina; Contreras-Bolton, Carlos; Toth, Paolo: Models and algorithms for the traveling salesman problem with time-dependent service times (2020)
  3. Carlos Gavidia-Calderon; César Beltrán Castañon: Isula: A java framework for ant colony algorithms (2020) not zbMATH
  4. Salman, Raad; Ekstedt, Fredrik; Damaschke, Peter: Branch-and-bound for the precedence constrained generalized traveling salesman problem (2020)
  5. Waissi, Gary R.; Kaushal, Pragya: A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (2020)
  6. Arnold, Florian; Gendreau, Michel; Sörensen, Kenneth: Efficiently solving very large-scale routing problems (2019)
  7. Brazil, Marcus; Volz, Marcus; Zachariasen, Martin; Ras, Charl; Thomas, Doreen: Computing minimum 2-edge-connected Steiner networks in the Euclidean plane (2019)
  8. Dhein, Guilherme; Zanetti, Marcelo Serrano; Bassi de Araújo, Olinto César; Cardoso, Ghendy Jr.: Minimizing dispersion in multiple drone routing (2019)
  9. Nowak, Maciek; Hewitt, Mike; Bachour, Hussam: Mileage bands in freight transportation (2019)
  10. Rossit, Diego Gabriel; Vigo, Daniele; Tohmé, Fernando; Frutos, Mariano: Visual attractiveness in routing problems: a review (2019)
  11. Sahai, Tuhin; Ziessler, Adrian; Klus, Stefan; Dellnitz, Michael: Continuous relaxations for the traveling salesman problem (2019)
  12. Salii, Yaroslav: Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (2019)
  13. Salles da Cunha, Alexandre; Lucena, Abilio: Modeling and solving the angular constrained minimum spanning tree problem (2019)
  14. Wang, Xingyin; Golden, Bruce; Wasil, Edward: A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (2019)
  15. Warnow, Tandy (ed.): Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret (2019)
  16. Yu, Qinxiao; Fang, Kan; Zhu, Ning; Ma, Shoufeng: A matheuristic approach to the orienteering problem with service time dependent profits (2019)
  17. Álvarez-Miranda, Eduardo; Luipersbeck, Martin; Sinnl, Markus: Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (2018)
  18. Archetti, Claudia; Feillet, Dominique; Mor, Andrea; Speranza, M. Grazia: An iterated local search for the traveling salesman problem with release dates and completion time minimization (2018)
  19. Balma, Ali; Salem, Safa Ben; Mrad, Mehdi; Ladhari, Talel: Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (2018)
  20. Beek, Onne; Raa, Birger; Dullaert, Wout; Vigo, Daniele: An efficient implementation of a static move descriptor-based local search heuristic (2018)

1 2 3 ... 31 32 33 next


Further publications can be found at: http://comopt.ifi.uni-heidelberg.de/publications/index.html