The Rollon–Rolloff Vehicle Routing Problem

References

• Assad A., Golden B., Ball M., Magnanti T. L., Monma C. L., Nemhauser G. L. Arc Routing Methods and Applications. Network Routing, Handbook in Operations Research and Management Science (1995) 8(Elsevier, Amsterdam, The Netherlands) 375–483Google Scholar
• Ball M., Magnanti T. L., Monma C. L., Nemhauser G. L.Network Routing, Handbook in Operations Research and Management Science (1995) 8(Elsevier, Amsterdam, The Netherlands) Google Scholar
• Beasley J., Jorsten K. Enhancing an Algorithm for Set Covering Problems. Eur. J. Oper. Res. (1992) 58:293–300Crossref, Google Scholar
• Bodin L. Twenty Years of Routing and Scheduling. Opns. Res. (1991) 38:571–579Link, Google Scholar
• Bodin L., Golden B., Assad A., Ball M. Routing and Scheduling of Vehicles and Crews: The State Of the Art. Comput. Opns. Res. (1983) 10:69–211Google Scholar
• Christofides N., Mingozzi A., Toth P., Christofides N., Mingozzi A., Toth P., Sandi C. The Vehicle Routing Problem. Combinatorial Optimization (1979) (John Wiley and Sons, Chichester, Great Britain) 315–338Google Scholar
• Clarke G., Wright J. W. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Opns. Res. (1964) 12:568–581Link, Google Scholar
• CPLEX OPTIMIZATION INC. (1996) . Using the CPLEX Callable Library and CPLEX Mixed Integer LibraryGoogle Scholar
• Cristallo G. Optimisation de Tournées de Véhicules de Transport Container. (1994) (Namur, Belgium). Mémoire de license en Sciences Économique et Sociales, Facultés Universitaires Notre-Dame de la PaixGoogle Scholar
• De Meulemeester L., Laporte G., Louveaux F. V., Semet F. Optimal Sequencing of Skip Collections and Deliveries. J. Oper. Res. Soc. (1997) 48:57–64Crossref, Google Scholar
• Desrosiers J., Dumas Y., Solomon M. M., Soumis F., Ball M., Magnanti T. L., Monma C. L., Nemhauser G. L. Time Constrained Routing and Scheduling. Network Routing, Handbook in Operations Research and Management Science (1995) 8(Elsevier, Amsterdam, The Netherlands) 35–139Google Scholar
• Eiselt H., Gendreau M., Laporte G. Arc Routing Problems, Part I: The Chinese Postman Problem. Opns. Res. (1995a) 43:231–242Link, Google Scholar
• Eiselt H., Gendreau M., Laporte G. Arc Routing Problems, Part II: The Rural Postman Problem. Opns. Res. (1995b) 43:399–413Link, Google Scholar
• Fischetti M., Toth P., Vigo D. A Branch-and- Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs. Opns. Res. (1994) 42:846–859Link, Google Scholar
• Fisher M., Ball M., Magnanti T. L., Monma C. L., Nemhauser G. L. Vehicle Routing. Network Routing, Handbook in Operations Research and Management Science (1995) 8(Elsevier, Amsterdam, The Netherlands) 1–33Google Scholar
• Golden B., Assad A.Vehicle Routing, Methods and Studies (1988) (North Holland Book, New York, NY) Google Scholar
• Laporte G., Mercure H., Nobert Y. An Exact Algorithm for the Asymmetrical Capacitated Vehicle Routing Problem. Networks (1986) 16:33–46Crossref, Google Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990) (John Wiley & Sons, Chichester, Great Britain) Google Scholar
• Mingozzi A., Christofides N., Hadjiconstantinou E. An Exact Algorithm for the Vehicle Routing Problem Based on the Set Partitioning Formulation. (1994) . Technical report, Department of Mathematics, University of Bologna, ItalyGoogle Scholar