论文信息 - Branch-and-Price Guided Search - (Extended Abstract)

Branch-and-Price Guided Search - (Extended 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.

Martin W. P. Savelsbergh | George L. Nemhauser | Mike Hewitt

[1] Matteo Fischetti,et al. A new ILP-based refinement heuristic for Vehicle Routing Problems , 2006, Math. Program..

[2] Renato F. Werneck,et al. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..

[3] Martin W. P. Savelsbergh,et al. Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem , 2010, INFORMS J. Comput..

[4] Martin W. P. Savelsbergh,et al. Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem , 2013, INFORMS J. Comput..

[5] Martin W. P. Savelsbergh,et al. An optimization algorithm for the inventory routing problem with continuous moves , 2008, Comput. Oper. Res..

[6] Martin W. P. Savelsbergh,et al. An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem , 2008, Transp. Sci..

[7] Claude Le Pape,et al. Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..