Pages that link to "Item:Q635520"
From MaRDI portal
The following pages link to An analysis of the extended Christofides heuristic for the \(k\)-depot TSP (Q635520):
Displaying 10 items.
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms (Q257224) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem (Q1752857) (← links)
- Exact and heuristic algorithms for routing AGV on path with precedence constraints (Q1793242) (← links)
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem (Q2010925) (← links)
- The \(m\)-Steiner traveling salesman problem with online edge blockages (Q2045027) (← links)
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872) (← links)
- Approximation algorithms for the \(k\)-depots Hamiltonian path problem (Q2128771) (← links)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots (Q2802244) (← links)
