Cutting Planes for Branch-and-Price Algorithms

Publication: Research - peer-reviewJournal article – Annual report year: 2011

View graph of relations

This article presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be derived using the variables of an equivalent compact formulation (i.e., the subproblem variables) or the master problem variables. In the first case, cuts are added to the compact formulation, either at the master level or the subproblem level, and the decomposition process is reapplied. In the second case, we show that it is possible to model inequalities defined on the master problem variables by adding new variables and constraints to the subproblem formulation. The augmented subproblem indirectly indicates that there exists an augmented compact formulation that includes these new variables and constraints. Three examples on how to apply this framework are presented: the vehicle routing problem with time windows, the edge coloring problem, and the cutting stock problem. © 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 58(4), 301–310 2011
Original languageEnglish
Issue number4
Pages (from-to)301-310
StatePublished - Nov 2011
CitationsWeb of Science® Times Cited: 17


  • column generation, integer programming, cutting planes, Dantzig-Wolfe decomposition
Download as:
Download as PDF
Select render style:
Download as HTML
Select render style:
Download as Word
Select render style:

ID: 5881869