The multiple traveling salesman problem on spiders
DOI10.1007/978-3-030-67731-2_24zbMATH Open1490.90253OpenAlexW3123988555MaRDI QIDQ831830FDOQ831830
Authors: Pedro Pérez-Escalona, Ivan Rapaport, José Soto, Ian Vidal 
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_24
Recommendations
- 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
- Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- Minmax \(p\)-traveling salesmen location problems on a tree
approximation algorithmsmultiple traveling salesman problempolynomial-time approximation schemessalesperson routing problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- The vehicle routing problem: An overview of exact and approximate algorithms
- Title not available (Why is that?)
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Vehicle routing problems on a line-shaped network with release time constraints
- Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
- Optimal control of plotting and drilling machines: A case study
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
- Approximation algorithms for min-max path cover problems with service handling time
- A framework for vehicle routing approximation schemes in trees
- Title not available (Why is that?)
Cited In (3)
- Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints
- Solving the multiple traveling salesperson problem on regular grids in linear time
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints
Uses Software
This page was built for publication: The multiple traveling salesman problem on spiders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831830)
