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

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

1 2 3 ... 24 25 26 next

  1. Sundar, Kaarthik; Rathinam, Sivakumar: Multiple depot ring star problem: a polyhedral study and an exact algorithm (2017)
  2. Bian, Zhengbing; Gu, Qian-Ping; Zhu, Mingzhe: Practical algorithms for branch-decompositions of planar graphs (2016)
  3. Blanquero, Rafael; Carrizosa, Emilio; G.-Tóth, Boglárka; Nogales-Gómez, Amaya: $p$-facility Huff location problem on networks (2016)
  4. Büttner, Sabine; Krumke, Sven O.: Robust optimization for routing problems on trees (2016)
  5. Buzna, Ľuboš; Koháni, Michal; Janáček, Jaroslav: An approximative lexicographic MIN-MAX approach to the discrete facility location problem (2016)
  6. Calvete, Herminia I.; Galé, Carmen; Iranzo, José A.: MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (2016)
  7. Castro de Andrade, Rafael: New formulations for the elementary shortest-path problem visiting a given set of nodes (2016)
  8. Deng, Yicheng; Ren, Shengce; Yin, Lvjiang: Improved fruit fly optimization algorithm-based traveling salesman problem (2016)
  9. Elshaikh, Abdalla; Salhi, Said; Brimberg, Jack; Mladenović, Nenad; Callaghan, Becky; Nagy, Gábor: An adaptive perturbation-based heuristic: an application to the continuous $p$-centre problem (2016)
  10. Erdoğan, Güneş; Laporte, Gilbert; Rodríguez Chía, Antonio M.: Exact and heuristic algorithms for the Hamiltonian $p$-median problem (2016)
  11. Gunawan, Aldy; Lau, Hoong Chuin; Vansteenwegen, Pieter: Orienteering problem: a survey of recent variants, solution approaches and applications (2016)
  12. Leitner, Markus: Integer programming models and branch-and-cut approaches to generalized $\0,1,2$-survivable network design problems$ (2016)
  13. Leitner, Markus: Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (2016)
  14. Marzban, Marjan; Gu, Qian-Ping; Jia, Xiaohua: New analysis and computational study for the planar connected dominating set problem (2016)
  15. Subramanyam, Anirudh; Gounaris, Chrysanthos E.: A branch-and-cut framework for the consistent traveling salesman problem (2016)
  16. Taş, Duygu; Gendreau, Michel; Jabali, Ola; Laporte, Gilbert: The traveling salesman problem with time-dependent service times (2016)
  17. Wang, Yong; Remmel, Jeffrey B.: A binomial distribution model for the traveling salesman problem based on frequency quadrilaterals (2016)
  18. Weise, Thomas; Wu, Yuezhong; Chiong, Raymond; Tang, Ke; Lässig, Jörg: Global versus local search: the impact of population sizes on evolutionary algorithm performance (2016)
  19. Borna, Keivan; Khezri, Razieh: A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem (2015)
  20. Brusco, Michael J.; Steinley, Douglas: Affinity propagation and uncapacitated facility location problems (2015)

1 2 3 ... 24 25 26 next

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