On-line single-server dial-a-ride problems
Authors:
- 1 October 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 268 (1) , 91-105
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Algorithms for the On-Line Travelling Salesman1Algorithmica, 2001
- Routing a vehicle of capacity greater than oneDiscrete Applied Mathematics, 1998
- Scheduling Parallel Machines On-LineSIAM Journal on Computing, 1995
- Searching in the PlaneInformation and Computation, 1993
- Nonpreemptive Ensemble Motion Planning on a TreeJournal of Algorithms, 1993
- Chapter 9 Sequencing and scheduling: Algorithms and complexity1993
- Preemptive Ensemble Motion Planning on a TreeSIAM Journal on Computing, 1992
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm TravelSIAM Journal on Computing, 1988
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- Approximation Algorithms for Some Routing ProblemsSIAM Journal on Computing, 1978