An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
From MaRDI portal
Publication:1752857
Recommendations
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- Approximation algorithms for the \(k\)-depots Hamiltonian path problem
Cites work
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- A General Approximation Technique for Constrained Forest Problems
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A survey of recent research on location-routing problems
- 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
- Combined location-routing problems: A synthesis and future research directions
- Computing Minimum-Weight Perfect Matchings
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 5776838 (Why is no real title available?)
- Introduction to algorithms
- Primal-dual schema and Lagrangian relaxation for the k-location-routing problem
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
Cited in
(14)- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem
- The \(m\)-Steiner traveling salesman problem with online edge blockages
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
- Approximation algorithms for the \(k\)-depots Hamiltonian path problem
- Multi-depot traveling salesmen location problems on networks with special structure
- Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints
- Approximating split delivery path routing problems
- An ALNS metaheuristic for the family multiple traveling salesman problem
This page was built for publication: An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752857)
