Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks
DOI10.1016/J.EJCO.2021.100016zbMATH Open1530.90004OpenAlexW3217188511MaRDI QIDQ6169990FDOQ6169990
Authors: P. 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
Recommendations
- Some contributions of Ailsa H. Land to the study of the traveling salesman problem
- The traveling salesman problem. I: Theoretical issues
- A note on the traveling salesman problem
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
- On the solution of the traveling salesman problem once again
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- The traveling salesman problem. A computational study.
- On the solution of traveling salesman problems
- On the approximability of the traveling salesman problem
Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Eulerian and Hamiltonian graphs (05C45) History of operations research and mathematical programming (90-03)
Cites Work
- The traveling salesman problem. A computational study.
- A cutting plane procedure for the travelling salesman problem on road networks
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- A new class of cutting planes for the symmetric travelling salesman problem
- Computing nonsimple polygons of minimum perimeter
Cited In (1)
This page was built for publication: Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169990)
