Hardness of Preemptive Finite Capacity Dial-a-Ride

DOI10.1007/11830924_20MaRDI QIDQ3595392zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Dial a ride from k-forest
• On-line single-server dial-a-ride problems
• Algorithms for capacitated vehicle routing

Cited in

(5)

• The online food delivery problem on stars
• scientific article; zbMATH DE number 1420897 (Why is no real title available?)
• Euler is standing in line dial-a-ride problems with precedence-constraints
• Minimizing the maximum flow time in the online food delivery problem
• A hard dial-a-ride problem that is easy on average

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595392)