Some contributions of Ailsa H. Land to the study of the traveling salesman problem

DOI10.1016/J.EJCO.2021.100018MaRDI QIDQ6169992zbMATH OpenOpenAlexFDO

Authors G. Laporte

Publication date 12 July 2023

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) History of mathematics in the 21st century (01A61) History of operations research and mathematical programming (90-03)

Recommendations

• Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks
• The traveling salesman problem. I: Theoretical issues
• A note on the traveling salesman problem
• On Some Generalizations of the Travelling-Salesman Problem
• On the solution of traveling salesman problems
• On the approximability of the traveling salesman problem
• scientific article; zbMATH DE number 1855663
• scientific article; zbMATH DE number 4095236
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
• The traveling salesman problem and its variations

Cites work

• scientific article; zbMATH DE number 3115473 (Why is no real title available?)
• scientific article; zbMATH DE number 3438384 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A method for solving traveling-salesman problems
• An Automatic Method of Solving Discrete Programming Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• Integer Programming Formulation of Traveling Salesman Problems
• Integer programming approaches to the travelling salesman problem
• Maximum matching and a polyhedron with 0,1-vertices
• Solution of a Large-Scale Traveling-Salesman Problem
• The traveling salesman problem. A computational study.
• The traveling-salesman problem
• Using cutting planes to solve the symmetric Travelling Salesman problem

Cited in

(1)

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

This page was built for publication: Some contributions of Ailsa H. Land to the study of the traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169992)