On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

Abstract

Dantzig-Wolfe decomposition as applied to an integer program is a speci#c form of problem reformulation that aims at providing a tighter linear programming relaxation bound. The reformulation gives rise to an integer master problem, whose typically large number of variables is dealt with implicitly by using an integer programming column generation procedure… (More)
DOI: 10.1287/opre.48.1.111.12453

Topics

5 Figures and Tables

Cite this paper

@article{Vanderbeck2000OnDD, title={On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm}, author={François Vanderbeck}, journal={Operations Research}, year={2000}, volume={48}, pages={111-128} }