Worst-Case Analysis for Split Delivery Vehicle Routing Problems
Published Online:1 May 2006https://doi.org/10.1287/trsc.1050.0117
References
- Complexity and reducibility of the skip delivery problem. Transportation Sci. (2005) 39:182–187Link, Google Scholar
- A lower bound for the split delivery vehicle routing problem. Oper. Res. (2000) 48:801–810Link, Google Scholar
- Vehicle routing with split deliveries. Discrete Appl. Math. (1994) 50:239–254Crossref, Google Scholar
- Savings by split delivery routing. Transportation Sci. (1989) 23:141–145Link, Google Scholar
- Split delivery routing. Naval Res. Logist. (1990) 37:383–402Crossref, Google Scholar
- The split delivery vehicle scheduling problem with time windows and grid network distances. Comput. Oper. Res. (1995) 22:655–667Crossref, Google Scholar
- Vehicle routing with time windows and split deliveries. (2005) . Working paperGoogle Scholar
- Méthodes de résolution exacte pour les problèmes de tournées de véhicules. (1999) . Ph.D. thesis, École Centrale Paris, Paris, FranceGoogle Scholar
- Split-delivery routing in livestock feed distribution. J. Oper. Res. Soc. (1997) 48:107–116Crossref, Google Scholar
- Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. (1998) 76:261–286Crossref, Google Scholar

