A polynomial algorithm for a constrained traveling salesman problem

DOI10.1002/net.1025zbMath0990.90102DBLPjournals/networks/RubinsteinTW01OpenAlexW2064287614WikidataQ61714639 ScholiaQ61714639MaRDI QIDQ2748381

Nicholas C. Wormald, Joachim Hyam Rubinstein, Doreen Anne Thomas

Publication date: 14 October 2001

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.1025

zbMATH Keywords

Euclidean traveling salesman problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

On the generation of metric TSP instances with a large integrality gap by branch-and-cut ⋮ Hard to solve instances of the Euclidean traveling salesman problem ⋮ The \(x\)-and-\(y\)-axes travelling salesman problem

Cites Work

• Unnamed Item
• The convex-hull-and-line traveling salesman problem: A solvable case
• The Convex-hull-and-k-line Travelling Salesman Problem
• Steiner Trees for Terminals Constrained to Curves
• Efficient special case algorithms for the n-line planar traveling salesman problem
• The n-line traveling salesman problem

This page was built for publication: A polynomial algorithm for a constrained traveling salesman problem