The Travelling Salesman Problem for finite-sized cities

DOI10.1017/S096012951000037XzbMath1206.90139OpenAlexW2100483921WikidataQ62476778 ScholiaQ62476778MaRDI QIDQ3061161

Hugo Fort, Fredy R. Zypman, Mordechai Kornbluth

Publication date: 14 December 2010

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096012951000037x

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Optimization by Simulated Annealing
• The TSP phase transition
• Phase transitions in project scheduling
• Approximation algorithms for TSP with neighborhoods in the plane
• Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP

This page was built for publication: The Travelling Salesman Problem for finite-sized cities