Reformulation and Decomposition of Integer Programs

@inproceedings{Vanderbeck2010ReformulationAD,
  title={Reformulation and Decomposition of Integer Programs},
  author={François Vanderbeck and Laurence A. Wolsey},
  booktitle={50 Years of Integer Programming},
  year={2010}
}
We examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover reformulations based on decomposition, such as Lagrangean relaxation, the Dantzig-Wolfe reformulation and the resulting column generation and branch-and-price algorithms. This is followed by an examination of Benders’ type algorithms based… CONTINUE READING