Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation

Abstract

Dantzig-Wolfe decomposition is well-known to provide strong dual bounds for specially structured mixed integer programs (MIPs) in practice. However, the method is not implemented in any state-of-the-art MIP solver: it needs tailoring to the particular problem; the decomposition must be determined from the typical bordered block-diagonal matrix structure… (More)
DOI: 10.1007/978-3-642-20807-2_4

Topics

5 Figures and Tables

Cite this paper

@inproceedings{Bergner2011PartialCO, title={Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation}, author={Martin Bergner and Alberto Caprara and Fabio Furini and Marco E. L{\"u}bbecke and Enrico Malaguti and Emiliano Traversi}, booktitle={IPCO}, year={2011} }