Branch-and-Price Guided Search

(Extended Abstract)
  • Mike Hewitt
  • George L. Nemhauser
  • Martin Savelsbergh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7422)

Abstract

When solving large-scale integer programming (IP) models, there are the conflicting goals of solution quality and solution time. Solving realistic-size instances of many problems to optimality is still beyond the capability of state-of-the-art solvers. However, by reducing the size of the solution space, such as by fixing variables, good primal solutions frequently can be found quickly.

Keywords

Integer Program Extended Formulation Column Generation Master Problem Price Problem 
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. 1.
    Archetti, C., Speranza, M.G., Savelsbergh, M.W.P.: An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science 42, 22–31 (2008)CrossRefGoogle Scholar
  2. 2.
    Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming 102, 71–90 (2005)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    De Franceschi, R., Fischetti, M., Toth, P.: A new ILP-based refinement heuristic for vehicle routing problems. Mathematical Programming B 105, 471–499 (2006)MATHCrossRefGoogle Scholar
  4. 4.
    Fischetti, M., Lodi, A.: Local branching. Mathematical Programming 98, 23–47 (2003)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Fukasawa, R., Longo, H., Lysgaard, J., Aragao, M., Reis, M., Uchoa, E., Werneck, R.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 106, 491–511 (2006)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Hewitt, M., Nemhauser, G., Savelsbergh, M.: Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS Journal on Computing 22, 314–325 (2010)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Hewitt, M., Nemhauser, G., Savelsbergh, M.: Branch-and-price guided search for integer programs with an application to the multicommodity fixed charge network flow problem. To appear in INFORMS Journal on Computing (2012)Google Scholar
  8. 8.
    Savelsbergh, M., Song, J.-H.: An optimization algorithm for inventory routing with continuous moves. Computers and Operations Research 35, 2266–2282 (2008)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Mike Hewitt
    • 1
  • George L. Nemhauser
    • 2
  • Martin Savelsbergh
    • 3
  1. 1.Department of Industrial and Systems EngineeringRochester Institute of TechnologyUSA
  2. 2.H. Milton Stewart School of Industrial and Systems EngineeringGeorgia Institute of TechnologyUSA
  3. 3.School of Mathematical and Physical SciencesUniversity of NewcastleAustralia

Personalised recommendations