Serving Rides of Equal Importance for Time-Limited Dial-a-Ride-Reference-Cited by-同舟云学术

Serving Rides of Equal Importance for Time-Limited Dial-a-Ride

Published:2021 Issue: Volume: Page:35-50
ISSN:0302-9743
Container-title:Mathematical Optimization Theory and Operations Research
language:
Short-container-title:

Author:

Anthony Barbara M.^ORCID,Christman Ananya D.^ORCID,Chung Christine^ORCID,Yuen David^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-77876-7_3

Reference17 articles.

1. Anthony, B.M., et al.: Maximizing the number of rides served for dial-a-ride. In: Cacchiani, V., Marchetti-Spaccamela, A. (eds.) 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, (ATMOS 2019), vol. 75, pp. 11:1–11:15 (2019)

2. Anthony, B.M., Christman, A.D., Chung, C., Yuen, D.: Serving rides of equal importance for time-limited Dial-a-Ride (2021). https://www.cs.middlebury.edu/~achristman/papers/kseq.pdf. (Online preprint)

3. Archer, A., Bateni, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for prize-collecting Steiner tree and TSP. SIAM J. Comput. 40(2), 309–332 (2011)

4. Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621–636 (1989)

5. Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Program. 59(1–3), 413–420 (1993)

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

1. Earliest Deadline First Is a 2-Approximation for DARP with Time Windows;Combinatorial Optimization and Applications;2023-12-09