Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
From MaRDI portal
(Redirected from Publication:489718)
Recommendations
- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- Constant-factor approximations for cycle cover problems
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
Cites work
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1973378 (Why is no real title available?)
- scientific article; zbMATH DE number 1452992 (Why is no real title available?)
- scientific article; zbMATH DE number 6297716 (Why is no real title available?)
- A Survey of Approximation Results for Local Search Algorithms
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- 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
- Approximate Local Search in Combinatorial Optimization
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Fast local search algorithms for the handicapped persons transportation problem
- New local search approximation techniques for maximum generalized satisfiability problems
- On Syntactic versus Computational Views of Approximability
- PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k^*\)
- The design of approximation algorithms
- The traveling salesman problem and its variations.
- The vehicle routing problem. Latest advances and new challenges.
- Theoretical aspects of local search.
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
Cited in
(4)- An iterated local search algorithm for latency vehicle routing problems with multiple depots
- Approximation algorithms for solving the trip-constrained vehicle routing cover problems
- Locating depots for capacitated vehicle routing
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
This page was built for publication: Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489718)
