The multiple traveling salesman problem on spiders

DOI10.1007/978-3-030-67731-2_24zbMath1490.90253OpenAlexW3123988555MaRDI QIDQ831830

José Soto, Pedro Pérez-Escalona, Ian Vidal, Ivan Rapaport

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_24

zbMATH Keywords

approximation algorithmsmultiple traveling salesman problempolynomial-time approximation schemessalesperson routing problem

Mathematics Subject Classification ID

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)

Related Items (1)

Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Vehicle routing problems on a line-shaped network with release time constraints
• The vehicle routing problem: An overview of exact and approximate algorithms
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
• A framework for vehicle routing approximation schemes in trees
• Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
• Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Optimal control of plotting and drilling machines: A case study

This page was built for publication: The multiple traveling salesman problem on spiders