Pages that link to "Item:Q3158519"
From MaRDI portal
The following pages link to Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems (Q3158519):
Displaying 7 items.
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- Improved approximation algorithms for cumulative VRP with stochastic demands (Q2181250) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Approximating minimum Steiner point trees in Minkowski planes (Q3064040) (← links)
