The solution of some 100-city travelling salesman problems

DOI10.1016/j.ejco.2021.100017zbMath1530.90056OpenAlexW3215850519MaRDI QIDQ6169991

Ailsa Land

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

zbMATH Keywords

combinatorial optimizationtravelling salesman problemcut-and-price

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (1)

A cutting plane procedure for the travelling salesman problem on road networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Obituary: Ailsa H. Land, EURO Gold Medallist (1927--2021)
• On the symmetric travelling salesman problem I: Inequalities
• Integer programming approaches to the travelling salesman problem
• Using cutting planes to solve the symmetric Travelling Salesman problem
• Computer Solutions of the Traveling Salesman Problem
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: The solution of some 100-city travelling salesman problems