The multiple traveling salesman problem on spiders
type: Item
instance of: scholarly article
title: The multiple traveling salesman problem on spiders
zbMATH Open document ID: 1490.90253
DOI: 10.1007/978-3-030-67731-2_24
author: Pedro Pérez-Escalona
author: Ivan Rapaport
author: José Soto
author: Ian Vidal
publication date: 2022-03-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7497738
zbMATH Keywords: multiple traveling salesman problem
zbMATH Keywords: salesperson routing problem
zbMATH Keywords: approximation algorithms
zbMATH Keywords: polynomial-time approximation schemes
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: 978-3-030-67731-2 24
OpenAlex ID: W3123988555
cites work: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
cites work: A framework for vehicle routing approximation schemes in trees
cites work: A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
cites work: Optimal control of plotting and drilling machines: A case study
cites work: Q4796177
cites work: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: Q5187226
cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
cites work: Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
cites work: Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
cites work: Vehicle routing problems on a line-shaped network with release time constraints
description: scientific article; zbMATH DE number 7497738