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

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

1 2 3 ... 28 29 30 next

  1. Brazil, Marcus; Volz, Marcus; Zachariasen, Martin; Ras, Charl; Thomas, Doreen: Computing minimum 2-edge-connected Steiner networks in the Euclidean plane (2019)
  2. Nowak, Maciek; Hewitt, Mike; Bachour, Hussam: Mileage bands in freight transportation (2019)
  3. Rossit, Diego Gabriel; Vigo, Daniele; Tohmé, Fernando; Frutos, Mariano: Visual attractiveness in routing problems: a review (2019)
  4. Salii, Yaroslav: Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (2019)
  5. Wang, Xingyin; Golden, Bruce; Wasil, Edward: A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (2019)
  6. Yu, Qinxiao; Fang, Kan; Zhu, Ning; Ma, Shoufeng: A matheuristic approach to the orienteering problem with service time dependent profits (2019)
  7. Álvarez-Miranda, Eduardo; Luipersbeck, Martin; Sinnl, Markus: Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (2018)
  8. 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)
  9. Balma, Ali; Salem, Safa Ben; Mrad, Mehdi; Ladhari, Talel: Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (2018)
  10. Beek, Onne; Raa, Birger; Dullaert, Wout; Vigo, Daniele: An efficient implementation of a static move descriptor-based local search heuristic (2018)
  11. Bernardino, Raquel; Paias, Ana: Solving the family traveling salesman problem (2018)
  12. Burger, M.; Su, Z.; De Schutter, B.: A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (2018)
  13. Dhein, Guilherme; Neto, Alberto Francisco Kummer; de Araújo, Olinto César Bassi: The multiple traveling salesman problem with backup coverage (2018)
  14. Diarrassouba, Ibrahima; Labidi, Mohamed Khalil; Mahjoub, Ali Ridha: A hybrid optimization approach for the Steiner (k)-connected network design problem (2018)
  15. 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)
  16. Geremew, W.; Nam, N. M.; Semenov, A.; Boginski, V.; Pasiliao, E.: A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (2018)
  17. Goldbarg, Marco C.; Goldbarg, Elizabeth F. G.; Luna, Henrique P. L.; Menezes, Matheus S.; Corrales, Lucas: Integer programming models and linearizations for the traveling car renter problem (2018)
  18. Kobeaga, Gorka; Merino, María; Lozano, Jose A.: An efficient evolutionary algorithm for the orienteering problem (2018)
  19. Lu, Yongliang; Benlic, Una; Wu, Qinghua: Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (2018)
  20. Martins, Daniel; Vianna, Gabriel M.; Rosseti, Isabel; Martins, Simone L.; Plastino, Alexandre: Making a state-of-the-art heuristic faster with data mining (2018)

1 2 3 ... 28 29 30 next


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