Pages that link to "Item:Q3989545"

The following pages link to The n-line traveling salesman problem (Q3989545):

Displaying 11 items.

• Euclidean TSP between two nested convex obstacles (Q1041790) (← links)
• Special cases of the traveling salesman problem (Q1316125) (← links)
• The convex-hull-and-line traveling salesman problem: A solvable case (Q1332749) (← links)
• The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
• The two-convex-polygons TSP: A solvable case (Q1367695) (← links)
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
• Crane scheduling in railway yards: an analysis of computational complexity (Q1707828) (← links)
• The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)
• Euclidean TSP on two polygons (Q2268868) (← links)
• A polynomial algorithm for a constrained traveling salesman problem (Q2748381) (← links)
• Euclidean TSP in narrow strips (Q6541986) (← links)