The solution of some 100-city travelling salesman problems

DOI10.1016/J.EJCO.2021.100017MaRDI QIDQ6169991zbMATH OpenOpenAlexFDO

Authors Ailsa Land

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

zbMATH Keywords

combinatorial optimizationcut-and-pricetravelling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• Solution of large-scale symmetric travelling salesman problems
• Travelling salesman problem tools for microcomputers
• On the solution of traveling salesman problems
• scientific article; zbMATH DE number 1947373
• Certification of an optimal TSP tour through 85,900 cities

Cites work

• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 3554023 (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?)
• Integer programming approaches to the travelling salesman problem
• Maximum matching and a polyhedron with 0,1-vertices
• Obituary: Ailsa H. Land, EURO Gold Medallist (1927--2021)
• On the symmetric travelling salesman problem I: Inequalities
• Using cutting planes to solve the symmetric Travelling Salesman problem

Cited in

(2)

• A cutting plane procedure for the travelling salesman problem on road networks
• Deep clustering of the traveling salesman problem to parallelize its solution

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

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