Pages that link to "Item:Q3636315"
From MaRDI portal
The following pages link to APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS (Q3636315):
Displaying 11 items.
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Dubins traveling salesman problem with neighborhoods: a graph-based approach (Q1736545) (← links)
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
- Euclidean travelling salesman problem with location-dependent and power-weighted edges (Q2135191) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Approximation algorithms for TSP with neighborhoods in the plane (Q2768270) (← links)
- Euclidean Traveling Salesman Tours through Stochastic Neighborhoods (Q2872129) (← links)
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems (Q3158519) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)
