Pages that link to "Item:Q2467447"
From MaRDI portal
The following pages link to An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447):
Displaying 20 items.
- A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem (Q315496) (← links)
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP (Q635520) (← links)
- Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem (Q1752857) (← 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)
- A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem (Q2198264) (← links)
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots (Q2802244) (← links)
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
- A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem (Q3564143) (← links)
- An Approximation Algorithm for the Three Depots Hamiltonian Path Problem (Q4596182) (← links)
- An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem (Q6123387) (← links)