| Article ID: | iaor20021976 |
| Country: | Germany |
| Volume: | 53 |
| Issue: | 2 |
| Start Page Number: | 173 |
| End Page Number: | 203 |
| Publication Date: | Jan 2001 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Padberg M. |
| Keywords: | programming: integer |
We review classical valid linear inequalities for mixed-integer programming, i.e., Gomory's fractional and mixed-integer cuts, and discuss their use in branch-and-cut. In particular, a generalization of the recent mixed-integer rounding inequality and a sufficient condition for the global validity of classical cuts after branching has occurred are derived.