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

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

1 2 3 ... 32 33 34 next

  1. Brimberg, Jack; Drezner, Zvi: Improved starting solutions for the planar (p)-median problem (2021)
  2. Cicerone, Serafino; D’Emidio, Mattia; Di Stefano, Gabriele; Navarra, Alfredo: On the effectiveness of the genetic paradigm for polygonization (2021)
  3. Yurtsever, Alp; Tropp, Joel A.; Fercoq, Olivier; Udell, Madeleine; Cevher, Volkan: Scalable semidefinite programming (2021)
  4. Al-Furhud, Maha Ata; Ahmed, Zakir Hussain: Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem (2020)
  5. Althaus, Ernst; Rauterberg, Felix; Ziegler, Sarah: Computing Euclidean Steiner trees over segments (2020)
  6. Archetti, C.; Feillet, D.; Mor, A.; Speranza, M. G.: Dynamic traveling salesman problem with stochastic release dates (2020)
  7. Baniasadi, Pouya; Foumani, Mehdi; Smith-Miles, Kate; Ejov, Vladimir: A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (2020)
  8. Buckow, Jan-Niklas; Graf, Benjamin; Knust, Sigrid: The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (2020)
  9. Cacchiani, Valentina; Contreras-Bolton, Carlos; Toth, Paolo: Models and algorithms for the traveling salesman problem with time-dependent service times (2020)
  10. Carlos Gavidia-Calderon; César Beltrán Castañon: Isula: A java framework for ant colony algorithms (2020) not zbMATH
  11. Chung, Sung Hoon; Sah, Bhawesh; Lee, Jinkun: Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions (2020)
  12. Drezner, Zvi; Drezner, Taly Dawn: Biologically inspired parent selection in genetic algorithms (2020)
  13. Fachini, Ramon Faganello; Armentano, Vinícius Amaral: Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (2020)
  14. Gokbayrak, Kagan; Avci, Harun: A voltage drop limited decentralized electric power distribution network (2020)
  15. Hammami, Farouk; Rekik, Monia; Coelho, Leandro C.: A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (2020)
  16. Lancia, Giuseppe; Vidoni, Paolo: Finding the largest triangle in a graph in expected quadratic time (2020)
  17. Medrano, F. Antonio: The complete vertex (p)-center problem (2020)
  18. Paul, Alice; Freund, Daniel; Ferber, Aaron; Shmoys, David B.; Williamson, David P.: Budgeted prize-collecting traveling salesman and minimum spanning tree problems (2020)
  19. Qiao, Wen-Bao; Créput, Jean-Charles: Multiple (k)-opt evaluation multiple (k)-opt moves with GPU high performance local search to large-scale traveling salesman problems (2020)
  20. Salman, Raad; Ekstedt, Fredrik; Damaschke, Peter: Branch-and-bound for the precedence constrained generalized traveling salesman problem (2020)

1 2 3 ... 32 33 34 next


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