Branch-and-Price Guided Search
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.
KeywordsInteger Program Extended Formulation Column Generation Master Problem Price Problem
Unable to display preview. Download preview PDF.
- 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