The Online Dial-a-Ride Problem under Reasonable Load-Reference-Cited by-同舟云学术

The Online Dial-a-Ride Problem under Reasonable Load

Published:2000 Issue: Volume: Page:125-136
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Hauptmeier Dietrich,Krumke Sven O.,Rambau Jörg

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46521-9_11

Reference13 articles.

1. Lect Notes Comput Sci;N. Ascheuer,2000

2. Mikhail J. Atallah and S. Rao Kosaraju. Efficient solutions to some transportation problems with applications to minimizing robot arm travel. SIAM Journal on Computing, 17:849–869, 1988.

3. Georgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, and Maurizio Talamo. Algorithms for the on-line traveling salesman. Algorithmica, to appear.

4. Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.

5. Esteban Feuerstein and Leen Stougie. On-line single server dial-a-ride problems. Theoretical Computer Science, special issue on on-line algorithms, to appear.

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride;Lecture Notes in Computer Science;2023

2. Improved Bounds for Open Online Dial-a-Ride on the Line;Algorithmica;2022-12-12

3. An Improved Algorithm for Open Online Dial-a-Ride;Approximation and Online Algorithms;2022

4. Konzeptionen;Produktionstheorie 4;2021

5. System modeling of demand responsive transportation services: Evaluating cost efficiency of service and coordinated taxi usage;Transportation Research Part E: Logistics and Transportation Review;2018-04