References
- AhujaRKMagnatiTLOrlinJBNetwork Flows: Theory, Algorithms, and Applications1993
- AnilySMosheiovGThe traveling salesman problem with delivery and backhaulsOpns Res Lett199416111810.1016/0167-6377(94)90016-7
- BaldacciRHadjiconstantinouEMingozziAAn exact algorithm for the traveling salesman problem with deliveries and collectionsNetworks2003421264110.1002/net.10079
- Bang-JensenJGutinGDigraphs: Theory, Algorithms and Applications2001
- BerbegliaGCordeauJFGribkovskaiaILaporteGStatic pickup and delivery problems: a classification scheme and surveyTop20071513110.1007/s11750-007-0009-0
- ChekuriCPálMAn O(log n) approximation ratio for the asymmetric traveling salesman path problemTheor Comput2007319720910.4086/toc.2007.v003a010
- GendreauMLaporteGVigoDHeuristics for the traveling salesman problem with pickup and deliveryComput & Opns Res19992669971410.1016/S0305-0548(98)00085-9
- LamFNewmanATraveling salesman path problemsMath Program2008113395910.1007/s10107-006-0046-8
- LinSComputer solutions of the traveling salesman problemBell Syst Tech J1965442245226910.1002/j.1538-7305.1965.tb04146.x
- MosheiovGThe traveling salesman problem with pick-up and deliveryEur J Opl Res19947929931010.1016/0377-2217(94)90360-3
- NagyGSalhiSHeuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveriesEur J Opl Res200516212614110.1016/j.ejor.2002.11.003
- ReineltGThe Traveling Salesman. Computational Solutions for TSP Applications1994
- Thirteenth Annual Third-Party Logistics Study. (2008) Georgia Institute of Technology, Capgemini, Oracle and DHL.