Efficient special case algorithms for the n-line planar traveling salesman problem

DOI10.1002/net.3230100302zbMath0442.90094OpenAlexW2038774649MaRDI QIDQ3885551

No author found.

Publication date: 1980

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

NP-completenesspolynomial algorithmn-line planar traveling salesman problemspecific city location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)

Related Items (12)

The convex-hull-and-line traveling salesman problem: A solvable case ⋮ An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays ⋮ The Convex-hull-and-k-line Travelling Salesman Problem ⋮ Special cases of travelling salesman problems and heuristics ⋮ The two-convex-polygons TSP: A solvable case ⋮ On the nearest neighbor rule for the traveling salesman problem ⋮ A polynomial algorithm for a constrained traveling salesman problem ⋮ The \(x\)-and-\(y\)-axes travelling salesman problem ⋮ Lexicographically minimizing axial motions for the Euclidean TSP ⋮ Euclidean TSP on two polygons ⋮ Euclidean TSP between two nested convex obstacles ⋮ Special cases of the traveling salesman problem

This page was built for publication: Efficient special case algorithms for the n-line planar traveling salesman problem