The two-convex-polygons TSP: A solvable case

DOI10.1007/BF02568533MaRDI QIDQ1367695zbMATH OpenOpenAlexFDO

Authors Javier Tejel, Alfredo García

Publication date 21 May 1998

Published in Top (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02568533

zbMATH Keywords

convex polygondynamic programmingtravelling salesman problem

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The convex-hull-and-line traveling salesman problem: A solvable case
• The Convex-hull-and-k-line Travelling Salesman Problem
• Euclidean TSP on two polygons
• The traveling salesman problem with few inner points
• Polynomially solvable cases of the bipartite traveling salesman problem

Cites work

• Efficient special case algorithms for the n-line planar traveling salesman problem
• scientific article; zbMATH DE number 3882430 (Why is no real title available?)
• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• The convex-hull-and-line traveling salesman problem: A solvable case
• The n-line traveling salesman problem
• The order of points on the second convex hull of a simple polygon

Cited in

(6)

• A generalization of the convex-hull-and-line traveling salesman problem
• The convex-hull-and-line traveling salesman problem: A solvable case
• Polynomially solvable cases of the bipartite traveling salesman problem
• The \(x\)-and-\(y\)-axes travelling salesman problem
• Euclidean TSP on two polygons
• A polynomial algorithm for a constrained traveling salesman problem

This page was built for publication: The two-convex-polygons TSP: A solvable case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367695)