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

DOI10.1016/j.ejco.2021.100018zbMath1530.90003OpenAlexW3214875813MaRDI QIDQ6169992

Gilbert Laporte

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.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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparative analysis of several asymmetric traveling salesman problem formulations
• Integer Programming Formulation of Traveling Salesman Problems
• An Automatic Method of Solving Discrete Programming Problems
• Integer programming approaches to the travelling salesman problem
• Using cutting planes to solve the symmetric Travelling Salesman problem
• Solution of a Large-Scale Traveling-Salesman Problem
• The Traveling-Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• Computer Solutions of the Traveling Salesman Problem
• Maximum matching and a polyhedron with 0,1-vertices
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

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