Cutting planes for branch-and-price algorithms

Networks, pp. 301-310, 2011.

Cited by: 40|Bibtex|Views4|Links
EI
Keywords:
master problem variablebranch-and-price algorithmwiley periodicalssubproblem formulationnew variableMore(9+)

Abstract:

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 for...More

Code:

Data:

Your rating :
0

 

Tags
Comments