The two-convex-polygons TSP: A solvable case

DOI10.1007/BF02568533zbMath0888.90143OpenAlexW2121251584MaRDI QIDQ1367695

F. Javier Tejel, Alfredo Daniel Garcia

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

dynamic programmingconvex polygontravelling salesman problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The convex-hull-and-line traveling salesman problem: A solvable case
• The order of points on the second convex hull of a simple polygon
• Efficient special case algorithms for the n-line planar traveling salesman problem
• The n-line traveling salesman problem

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