Online Dial-a-Ride Problems: Minimizing the Completion Time
Authors:
- 24 March 2000
- book chapter
- Published by Springer Nature
- p. 639-650
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Combinatorial Online Optimization1999
- Euler Is Standing in LineLecture Notes in Computer Science, 1999
- Scheduling Parallel Machines On-LineSIAM Journal on Computing, 1995
- Competitive algorithms for the on-line traveling salesmanLecture Notes in Computer Science, 1995
- Serving requests with on-line routingLecture Notes in Computer Science, 1994
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm TravelSIAM Journal on Computing, 1988
- Approximation Algorithms for Some Routing ProblemsSIAM Journal on Computing, 1978