Pages that link to "Item:Q1332749"
From MaRDI portal
The following pages link to The convex-hull-and-line traveling salesman problem: A solvable case (Q1332749):
Displaying 15 items.
- An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (Q293394) (← links)
- Euclidean TSP between two nested convex obstacles (Q1041790) (← links)
- The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
- The two-convex-polygons TSP: A solvable case (Q1367695) (← links)
- On the integrality ratio of the subtour LP for Euclidean TSP (Q1785291) (← links)
- Routing heuristics for automated pick and place machines (Q1806942) (← links)
- Novel concave hull-based heuristic algorithm for TSP (Q2139346) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← 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)
- Well-solved cases of the 2-peripatetic salesman problem (Q4351794) (← links)
- Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane (Q4628046) (← links)
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
- Euclidean TSP in narrow strips (Q6541986) (← links)
