Solving the Single Vehicle Routing Problem with Variable Capacity
Published Online:16 Oct 2014https://doi.org/10.1287/trsc.2014.0556
References
- (2010) Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175:213–245.Crossref, Google Scholar
- (2008) Heuristic and exact algorithms for the identical parallel machine scheduling problem. INFORMS J. Comput. 20:333–344.Link, Google Scholar
- (1971) Deterministic production planning with concave costs and capacity constraints. Management Sci. 18:12–20.Link, Google Scholar
- (1980) Deterministic production planning: Algorithms and complexity. Management Sci. 26:669–679.Link, Google Scholar
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, A Series of Books in the Mathematical Sciences (W. H. Freeman and Co, San Francisco).Google Scholar
- (2007) The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York).Google Scholar
- (2002) The Traveling Salesman Problem and Its Variations (Kluwer Academic Publishers, Dordrecht, Netherlands).Google Scholar
- (1960) Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Bellman R, Hall M, eds. Proc. Symp. Applied Math., Vol. 10 (American Mathematics Society, Providence, RI), 113–127.Crossref, Google Scholar
- (2013) Vehicle routing: Historical perspective and recent contributions. EURO J. Transportation Logist. 2:1–4.Crossref, Google Scholar
- (2006) Projection results for vehicle routing. Math. Programming 105:251–274.Crossref, Google Scholar
- (2002) Branch-and-cut algorithms for the capacitated VRP. Toth P, Vigo D, eds. The Vehicle Routing Problem, Vol. 9 (SIAM Monographs on Discrete Mathematics and Applications, Philadelphia), 53–84.Crossref, Google Scholar
- (2002) The Vehicle Routing Problem, Vol. 9 (SIAM Monographs on Discrete Mathematics and Applications, Philadelphia).Crossref, Google Scholar

