Complexity and Reducibility of the Skip Delivery Problem

References

• Archetti C., Speranza M. G. The 1-skip collection problem. (2002) . Technical Report Number 209, Department of Quantitative Methods, University of Brescia, Brescia, ItalyGoogle Scholar
• Archetti C., Mansini R., Speranza M. G. The split delivery vehicle routing problem with small capacity. (2001) . Technical Report Number 201, Department of Quantitative Methods, University of Brescia, Brescia, ItalyGoogle Scholar
• Ball M., Bodin L., Baldacci R., Mingozzi A. The rollon-rolloff vehicle routing problem. Transportation Sci. (2000) 34:271–288Link, Google Scholar
• Christofides N., Lawler E. L., Lenstra J. K., Rinnoy Kan A. H. G., Shmoys D. B. Vehicle routing. The Traveling Salesman Problem (1985) (John Wiley and Sons, Chichester, UK) Google 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, UK) Google Scholar
• De Meulemeester L., Laporte G., Louveaux F. V., Semet F. Optimal scheduling of skip collections and deliveries. J. Oper. Res. Soc. (1997) 48:57–64Crossref, Google Scholar
• Dror M., Trudeau P. Savings by split delivery routing. Transportation Sci. (1989) 23:141–145Link, Google Scholar
• Dror M., Trudeau P. Split delivery routing. Naval Res. Logist. (1990) 37:383–402Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, New York) Google Scholar
• Gerards A. M. H., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Matching. Handbooks in Operations Research and Management Science (1995) 7(North-Holland, Amsterdam, The Netherlands) Google Scholar
• Golden B. L., Assad A. A.Vehicle Routing: Methods and Studies (1988) (North-Holland, Amsterdam, The Netherlands) Google Scholar
• Gourdin É., Labbé M., Laporte G. The uncapacitated facility location problem with client matching. Oper. Res. (2000) 48:671–685Link, Google Scholar
• Hannemann M. M., Schwartz A. Implementing weighted b-matching algorithms: Towards a flexible software design. ACM J. Experiment. Algorithmics (2000) 5(Article 8Google Scholar
• Toth P., Vigo D.The Vehicle Routing Problem (2002) (SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA) Crossref, Google Scholar