Publisher
Springer International Publishing
Reference28 articles.
1. Aggoun, A., Beldiceanu, N.: Extending chip in order to solve complex scheduling and placement problems. Math. Comput. Modell. 17(7), 57–73 (1993)
2. Braekers, K.: Dial-a-Ride Problems Instances.
http://alpha.uhasselt.be/kris.braekers/
(2019). Accessed 2 Dec 2019
3. Lecture Notes in Computer Science;Q Cappart,2018
4. Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573–586 (2006)
5. Cordeau, J., Laporte, G.: The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR 1(2), 89–101 (2003).
https://doi.org/10.1007/s10288-002-0009-8