Aggregation and Mixed Integer Rounding to Solve MIPs

Abstract

A separation heuristic for mixed integer programs is presented that theoretically allows one to derive several families of “strong” valid inequalities for specific models and computationally gives results as good as or better than those obtained from several existing separation routines including flow cover and integer cover inequalities. The heuristic is based on aggregation of constraints of the original formulation and mixed integer rounding inequalities.

DOI: 10.1287/opre.49.3.363.11211

Extracted Key Phrases

5 Figures and Tables

0102030'00'02'04'06'08'10'12'14'16
Citations per Year

210 Citations

Semantic Scholar estimates that this publication has 210 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Marchand2001AggregationAM, title={Aggregation and Mixed Integer Rounding to Solve MIPs}, author={Hugues Marchand and Laurence A. Wolsey}, journal={Operations Research}, year={2001}, volume={49}, pages={363-371} }