Pages that link to "Item:Q1752857"
From MaRDI portal
The following pages link to An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem (Q1752857):
Displaying 11 items.
- 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)
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← 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)
- Multi-depot traveling salesmen location problems on networks with special structure (Q2178369) (← links)
- Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals (Q2420806) (← links)
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447) (← links)
- A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints (Q6556160) (← links)
