Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks

DOI10.1016/j.ejco.2021.100016zbMath1530.90004OpenAlexW3217188511MaRDI QIDQ6169990

Panagiotis A. Miliotis

Publication date: 12 July 2023

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejco.2021.100016

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) History of operations research and mathematical programming (90-03) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• A cutting plane procedure for the travelling salesman problem on road networks
• A new class of cutting planes for the symmetric travelling salesman problem
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Computing nonsimple polygons of minimum perimeter

This page was built for publication: Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks