Hardness of Preemptive Finite Capacity Dial-a-Ride

DOI10.1007/11830924_20zbMath1155.68396OpenAlexW2117324637MaRDI QIDQ3595392

Inge Li Gørtz

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_20

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Minimizing the maximum flow time in the online food delivery problem ⋮ The online food delivery problem on stars

This page was built for publication: Hardness of Preemptive Finite Capacity Dial-a-Ride