Minimum Makespan Multi-vehicle Dial-a-Ride

DOI10.1007/978-3-642-04128-0_48zbMath1256.90014arXiv1102.5450WikidataQ60554461 ScholiaQ60554461MaRDI QIDQ3639273

R. Ravi, Inge Li Gørtz, Viswanath Nagarajan

Publication date: 29 October 2009

Published in: Lecture Notes in Computer Science, ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.5450

zbMATH Keywords

scheduling; vehicle routing; approximation algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

68W25: Approximation algorithms