Semi-preemptive routing on trees
From MaRDI portal
Publication:1003476
DOI10.1016/j.dam.2008.05.016zbMath1155.90347MaRDI QIDQ1003476
Sven O. Krumke, Rainer Schrader, Dirk Räbiger
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.016
transportation; approximation; dial-a-ride; pickup and delivery; colored arborescences; Stacker crane
90C35: Programming involving graphs or networks
05C05: Trees
05C90: Applications of graph theory
90B20: Traffic problems in operations research
Related Items
Cites Work
- Unnamed Item
- Semi-preemptive routing on a linear and circular track
- Exact arborescences, matchings and cycles
- Routing a vehicle of capacity greater than one
- Nonpreemptive Ensemble Motion Planning on a Tree
- A threshold of ln n for approximating set cover
- Semi–preemptive routing on a line
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- Preemptive Ensemble Motion Planning on a Tree
- Euler is standing in line dial-a-ride problems with precedence-constraints