1. Atallah, M.J., Chen, D.Z., Lee, D.T.: An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Algorithmica 14(5), 429–441 (1995).
https://doi.org/10.1007/BF01192049
2. Cordeau, J.F., Laporte, G.: The dial-a-ride problem (DARP): variants, modeling issues and algorithms. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1(2), 89–101 (2003)
3. Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the 12th Annual IEEE Conference on Computational Complexity. CCC ’97, pp. 262–273. IEEE Computer Society, Washington (1997)
4. Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time constrained routing and scheduling. Handb. Oper. Res. Manag. Sci. 8, 35–139 (1995)
5. Dumas, Y., Soumis, F., Desrosiers, J.: Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transp. Sci. 24(2), 145–152 (1990)