Geometric Approaches to Solving the Traveling Salesman Problem

DOI10.1287/mnsc.23.11.1208zbMath0373.90074OpenAlexW2092009255MaRDI QIDQ4152355

John P. Norback, Love, Robert F.

Publication date: 1977

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.11.1208

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (7)

Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs ⋮ Linear facility location. Solving extensions of the basic problem ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ A diagonal completion and 2-optimal procedure for the travelling salesman problem ⋮ An improved heuristic for the capacitated arc routing problem ⋮ Heuristic methods and applications: A categorized survey ⋮ Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation

This page was built for publication: Geometric Approaches to Solving the Traveling Salesman Problem