On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem. I

DOI10.1016/0771-050X(81)90057-7zbMath0471.90089MaRDI QIDQ1158109

Selim G. Akl

Publication date: 1981

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

number of solutionsheuristic algorithmnear-optimal solutionsrandom Euclidean travelling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cites Work

• An adaptive and cost-optimal parallel algorithm for minimum spanning trees
• The Euclidean traveling salesman problem is NP-complete
• The Traveling Salesman Problem: A Survey
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem. I