The n-line traveling salesman problem

DOI10.1002/net.3230220106zbMath0783.90118OpenAlexW2145466017MaRDI QIDQ3989545

Günter Rote

Publication date: 28 June 1992

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

Euclidean traveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

The convex-hull-and-line traveling salesman problem: A solvable case ⋮ The Convex-hull-and-k-line Travelling Salesman Problem ⋮ Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane ⋮ The two-convex-polygons TSP: A solvable case ⋮ Crane scheduling in railway yards: an analysis of computational complexity ⋮ A polynomial algorithm for a constrained traveling salesman problem ⋮ The \(x\)-and-\(y\)-axes travelling salesman problem ⋮ Euclidean TSP on two polygons ⋮ Euclidean TSP between two nested convex obstacles ⋮ Special cases of the traveling salesman problem

Cites Work

• On Recursions Connected With Symmetric Groups I
• On Solutions of x^d = 1 In Symmetric Groups

This page was built for publication: The n-line traveling salesman problem