- ArmstrongG.R. and GarfinkelR.S. (1982). Dynamic programming solution of the single and multiple vehicle pickup and delivery problem with application to Dial-A-Ride. Working Paper No. 162, U. of Tennessee.
- AssadA., BallM., BodinL. and GoldenB. (1981). Combined distribution, routing and scheduling in a large commercial firm. Proceedings of the 1981 Northeast AIDS Conference (PavanR. and AndersonP., eds.), Boston, 99–102.
- BallM., GoldenB., AssadA. and BodinL. (1983). Planning for truck fleet size in the presence of a common carrier option. Decision Sciences, 14, 103–120.
- BendersJ.F. (1962). Partition procedure for solving mixed-variables programming problems. Numerische Mathematik, 4, 238–252.
- BodinL. and GoldenB. (1981). Classification in vehicle routing and scheduling. Networks, 11, 97–108.
- BodinL., GoldenB., AssadA. and BallM. (1983). Routing and scheduling of vehicles and crews – The state of the art. Computers and Operations Research, 10, 63–211.
- BodinL. and SextonT. (to appear). The multi-vehicle subscriber Dial-A-Ride problem. The Delivery of Urban Services, TIMS Studies in the Management Sciences, 22.
- BusackerR.G. and SaatyT.L. (1965). Finite Graphs and Networks: An Introduction with Applications. McGraw-Hill, New York.
- ChoiY.-M. (1984). The single vehicle trailer routing and scheduling problem with partial loads, time windows and dwell times. Ph.D. Dissertation, Dept. Applied Mathematics and Statistics, SUNY Stony Brook, New York.
- CullenF.H., JarvisJ.J. and RatliffH.D. (1981). Set partitioning based heuristics for interactive routing. Networks, 11, 125–144.
- FisherM.L. and JaikumarR. (1981). A generalized assignment heuristic for vehicle routing. Networks 11, 109–124.
- FordL.R. and FulkersonD.R. (1962). Flows in Networks, Princeton University Press, PrincetonNew Jersey.
- KleinM. (1967). A primal method for minimal cost flows with applications to the assignment and transportation problems. Management Science, 14, 205–220.
- LenstraJ. and Rinnooy KanA. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11, 221–227.
- LoveR.R.Jr. (1981). Traffic scheduling via Benders' decomposition. Mathematical Programming Study, 15, 102–124.
- MagnantiT.L. (1981). Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. Networks, 11, 179–214.
- PsaraftisH.N. (1980). A dynamic programming solution to the single vehicle many-to-many immediate request Dial-A-Ride pro-blem. Transportation Science, 14, 130–154.
- PsaraftisH.N. (1983). An exact algorithm for the single vehicle many-to-many Dial-A-Ride problem with time windows. Transportation Science, 17, 351–357.
- SextonT.R. (1979). The single vehicle many-to-many routing and scheduling problem. Ph.D. Dissertation, Dept. Applied Mathematics and Statistics, SUNY Stony Brook, New York.
- SextonT.R. and BodinL.D. (1981). The single vehicle many-to-many routing and scheduling problem with customer-dependent dwell times. Working Paper, SUNY Stony Brook.
- SextonT.R. and BodinL.D. (1985a). Optimizing single vehicle many-to-many operations with desired delivery times: I. scheduling. Transportation Science, 19, 378–410.
- SextonT.R. and BodinL.D. (1985b). Optimizing single vehicle many-to-many operations with desired delivery times: II. routing. Transportation Science, 19, 411–435.
- SolomonM.M. (1978). Vehicle routing and scheduling with time window constraints: Models and algorithms. Working Paper No. 83–02-01, The Wharton School, U. of Pennsylvania.
- SteinD.M. (1978). Scheduling Dial-A-Ride transportation systems. Transportation Science, 12, 232–249.
- Choose new content alerts to be informed about new research of interest to you
- Easy remote access to your institution's subscriptions on any device, from any location
- Save your searches and schedule alerts to send you new results
- Export your search results into a .csv file to support your research