Classical cuts for mixed-integer programming and branch-and-cut

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 (MIR) inequality and a sufficient condition for the global validity of classical cuts after branching has occurred are derived. Copyright Springer-Verlag Berlin Heidelberg 2001

MoreLess

Year of publication:	2001
Authors:	Padberg, Manfred
Published in:	Computational Statistics. - Springer. - Vol. 53.2001, 2, p. 173-203
Publisher:	Springer
Subject:	Mixed-integer programming \| cutting planes \| Gomory cuts \| branch-and-cut

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010847672