Advertisement

TOP

, Volume 18, Issue 1, pp 36–38 | Cite as

Comments on: Routing problems with loading constraints

  • Juan-José Salazar-González
Discussion

Keywords

Master Problem Short Path Problem Side Constraint Math Program Route Length 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math Program 120(2):347–380 CrossRefGoogle Scholar
  2. Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80–91 CrossRefGoogle Scholar
  3. Fukasawa R, Longo H, Lysgaard J, Poggi de Aragão M, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program 106(3):491–511 CrossRefGoogle Scholar
  4. Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155–170 CrossRefGoogle Scholar
  5. Toth P, Vigo D (2002) The vehicle routing problem. SIAM monographs on discrete mathematics and applications. SIAM, Philadelphia Google Scholar

Copyright information

© Sociedad de Estadística e Investigación Operativa 2010

Authors and Affiliations

  1. 1.DEIOC—University of La LagunaLa LagunaSpain

Personalised recommendations