A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
From MaRDI portal
Publication:2802244
Recommendations
- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
- Multi-depot multiple TSP: a polyhedral study and computational results
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
- An approximation algorithm for the three depots Hamiltonian path problem
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- Approximability of the multiple stack TSP
- A multi-depot travelling salesman problem and its iterative and integrated approaches
Cites work
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
- A tabu search heuristic for the multi-depot vehicle routing problem
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
- A variation of the generalized assignment problem arising in the New Zealand dairy industry
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Approximation Algorithms for Some Postman Problems
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- Approximations for minimum and min-max vehicle routing problems
- New assignment algorithms for the multi-depot vehicle routing problem
- State-of-the art review-evolutionary algorithms for vehicle routing
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
Cited in
(19)- A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints
- The multiple traveling salesman problem on spiders
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
- Reducing Path TSP to TSP
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem
- Approximation algorithms for the \(k\)-depots Hamiltonian path problem
- Improved approximation algorithms for multidepot capacitated vehicle routing
- 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
- Approximations for the Steiner multicycle problem
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
- Exact and heuristic algorithms for routing AGV on path with precedence constraints
- New approximation algorithms for the heterogeneous weighted delivery problem
- New approximation algorithms for the heterogeneous weighted delivery problem
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- Multi-depot multiple TSP: a polyhedral study and computational results
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem
This page was built for publication: A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802244)
