Euler is standing in line dial-a-ride problems with precedence-constraints
From MaRDI portal
Publication:5948963
DOI10.1016/S0166-218X(00)00390-5zbMath0990.90015MaRDI QIDQ5948963
Jörg Rambau, Hans-Christoph Wirth, Sven O. Krumke, D. Hauptmeier
Publication date: 12 November 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items
A hard dial-a-ride problem that is easy on average ⋮ The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail ⋮ Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ An improved algorithm for open online dial-a-ride ⋮ Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models ⋮ Semi-preemptive routing on trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Routing a vehicle of capacity greater than one
- Nonpreemptive Ensemble Motion Planning on a Tree
- Fast Algorithms for Finding Nearest Common Ancestors
- Postman tour on a graph with precedence relation on arcs
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Finding optimum branchings
- On-line single-server dial-a-ride problems
