A hard dial-a-ride problem that is easy on average
From MaRDI portal
Publication:880497
DOI10.1007/s10951-005-6811-3zbMath1123.90019MaRDI QIDQ880497
Amin Coja-Oghlan, Sven O. Krumke, Till Nierhoff
Publication date: 15 May 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-005-6811-3
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Cites Work
- The Steiner problem with edge lengths 1 and 2
- Heuristics for semirandom graph problems
- Nonpreemptive Ensemble Motion Planning on a Tree
- A heuristic for the Stacker Crane Problem on trees which is almost surely exact
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- A Note on the Complexity of a Simple Transportation Problem
- Algorithms for the on-line travelling salesman
- Euler is standing in line dial-a-ride problems with precedence-constraints
- On-line single-server dial-a-ride problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item