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

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

1 2 3 ... 33 34 35 next

  1. Accorsi, Luca; Lodi, Andrea; Vigo, Daniele: Guidelines for the computational testing of machine learning approaches to vehicle routing problems (2022)
  2. Jiang, Li; Zang, Xiaoning; Dong, Junfeng; Liang, Changyong: A covering traveling salesman problem with profit in the last mile delivery (2022)
  3. Jiang, Li; Zang, Xiaoning; Dong, Junfeng; Liang, Changyong; Mladenovic, Nenad: A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak (2022)
  4. Karimi-Mamaghan, Maryam; Mohammadi, Mehrdad; Meyer, Patrick; Karimi-Mamaghan, Amir Mohammad; Talbi, El-Ghazali: Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (2022)
  5. Kian, Ramez; Erdoğan, Güneş; de Leeuw, Sander; Sibel Salman, F.; Sabet, Ehsan; Kara, Bahar Y.; Demir, Muhittin H.: Logistics planning of cash transfer to Syrian refugees in Turkey (2022)
  6. Lin, Jian; Zeng, Xiangfei; Liu, Jianxun; Li, Keqin: Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem (2022)
  7. Nascimento Silva, Janio Carlos; Coelho, Igor M.; Souza, Ueverton S.; Ochi, Luiz Satoru; Coelho, Vitor N.: Finding the maximum multi improvement on neighborhood exploration (2022)
  8. Zang, Xiaoning; Jiang, Li; Ratli, Mustapha; Ding, Bin: A parallel variable neighborhood search for solving covering salesman problem (2022)
  9. Brimberg, Jack; Drezner, Zvi: Improved starting solutions for the planar (p)-median problem (2021)
  10. Chen, Xujin; Hu, Xiaodong; Jia, Xiaohua; Tang, Zhongzheng; Wang, Chenhao; Zhang, Ying: Algorithms for the metric ring star problem with fixed edge-cost ratio (2021)
  11. Cherkesly, Marilène; Contardo, Claudio: The conditional (p)-dispersion problem (2021)
  12. Cicerone, Serafino; D’Emidio, Mattia; Di Stefano, Gabriele; Navarra, Alfredo: On the effectiveness of the genetic paradigm for polygonization (2021)
  13. Guimarães, Dilson Almeida; Salles da Cunha, Alexandre: The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (2021)
  14. Hougardy, Stefan; Zhong, Xianghui: Hard to solve instances of the Euclidean traveling salesman problem (2021)
  15. Kobeaga, Gorka; Merino, María; Lozano, Jose A.: On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (2021)
  16. Sinnl, Markus: Mixed-integer programming approaches for the time-constrained maximal covering routing problem (2021)
  17. Sun, Yuan; Ernst, Andreas; Li, Xiaodong; Weiner, Jake: Generalization of machine learning for problem reduction: a case study on travelling salesman problems (2021)
  18. Yurtsever, Alp; Tropp, Joel A.; Fercoq, Olivier; Udell, Madeleine; Cevher, Volkan: Scalable semidefinite programming (2021)
  19. Al-Furhud, Maha Ata; Ahmed, Zakir Hussain: Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem (2020)
  20. Althaus, Ernst; Rauterberg, Felix; Ziegler, Sarah: Computing Euclidean Steiner trees over segments (2020)

1 2 3 ... 33 34 35 next


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