Capacitated Vehicle Routing with Nonuniform Speeds

References

• Altinkemer K, Gavish B (1987) Heuristics for unequal weight delivery problems with a fixed error guarantee. Oper. Res. Lett. 6(4):149–158.Crossref, Google Scholar
• Altinkemer K, Gavish B (1990) Heuristics for delivery problems with constant error guarantees. Transportation Res. 24:294–297.Abstract, Google Scholar
• Arkin EM, Hassin R, Levin A (2006) Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1):1–18.Crossref, Google Scholar
• Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5):753–782.Crossref, Google Scholar
• Awerbuch B, Baratz A, Peleg D (1990) Cost-sensitive analysis of communication protocols. Proc. Sympos. Principles of Distributed Comput. (ACM, New York), 177–187.Crossref, Google Scholar
• Blum A, Chawla S, Karger DR, Lane T, Meyerson A, Minkoff M (2007) Approximation algorithms for orienteering and discounted-reward TSP. SIAM J. Comput. 37(2):653–670.Crossref, Google Scholar
• Bompadre A, Dror M, Orlin JB (2006) Improved bounds for vehicle routing solutions. Discrete Optim. 3(4):299–316.Crossref, Google Scholar
• Chekuri C, Kumar A (2004) Maximum coverage problem with group budget constraints and applications. Proc. Workshop on Approximation Algorithms for Combin. Optim. (Springer, Berlin), 72–83.Crossref, Google Scholar
• Chekuri C, Korula N, Pál M (2012) Improved algorithms for orienteering and related problems. ACM Trans. Algorithms 8(3):23.Crossref, Google Scholar
• Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh.Google Scholar
• Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1998) Combinatorial Optimization (John Wiley & Sons, New York).Google Scholar
• Das A, Mathieu C (2010) A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. Proc. Sympos. Discrete Algorithms (SIAM, Philadelphia), 390–403.Crossref, Google Scholar
• Even G, Garg N, Könemann J, Ravi R, Sinha A (2004) Min-max tree covers of graphs. Oper. Res. Lett. 32(4):309–315.Crossref, Google Scholar
• Frederickson GN, Hecht MS, Kim CE (1978) Approximation algorithms for some routing problems. SIAM J. Comput. 7(2):178–193.Crossref, Google Scholar
• Gupta A, Nagarajan V, Ravi R (2012) Approximation algorithms for VRP with stochastic demands. Oper. Res. 60(1):123–127.Link, Google Scholar
• Haimovich M, Kan AHGR (1985) Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4):527–542.Link, Google Scholar
• Khuller S, Raghavachari B, Young NE (1995) Balancing minimum spanning trees and shortest-path trees. Algorithmica 14(4):305–321.Crossref, Google Scholar
• Lenstra JK, Shmoys DB, Tardos É (1990) Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46(1–3):259–271.Crossref, Google Scholar
• Mitchell JSB (1999) Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. 28(4):1298–1309.Crossref, Google Scholar
• Schrijver A (2003) Combinatorial Optimization (Springer, Berlin).Google Scholar
• Toth P, Vigo D, eds. (2002) The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications (SIAM, Philadelphia).Crossref, Google Scholar