An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
From MaRDI portal
(Redirected from Publication:2467447)
Recommendations
- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
Cites work
- A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Degree-bounded minimum spanning trees
- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Maximizing concave functions in fixed dimension
- Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
- Technical Note—A Note on the Multiple Traveling Salesmen Problem
- Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges
- The constrained minimum spanning tree problem
- The traveling salesman problem and its variations
- The traveling salesman. Computational solutions for RSP applications
- Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
Cited in
(27)- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- The multiple traveling salesman problem on spiders
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- A Lagrangian-based algorithm for a combinatorial motion planning problem
- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
- An approximation algorithm for vehicle routing with compatibility constraints
- A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem
- An approximation algorithm for the three depots Hamiltonian path problem
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem
- Approximation algorithms for the \(k\)-depots Hamiltonian path problem
- Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
- A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
- Improved algorithms for joint optimization of facility locations and network connections
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
- The \(m\)-Steiner traveling salesman problem with online edge blockages
- New approximation algorithms for the heterogeneous weighted delivery problem
- New approximation algorithms for the heterogeneous weighted delivery problem
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- Multi-depot multiple TSP: a polyhedral study and computational results
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
- An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem
This page was built for publication: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467447)
