Mixing mixed-integer inequalities
Copyright policy )Mixing mixed-integer inequalities
A procedure is given for generating new valid inequalities for a mixed-integer region. The starting point is to consider mixed-integer rounding inequalities [cf. \textit{G. L. Nemhauser} and \textit{L. A. Wolsey}, Math. Program. Ser. A 46, 379--390 (1990; Zbl 0735.90049)] and by combining or ``mixing'' them new valid inequalities are constructed. The procedure is discussed for various important applications in production planning, capacitated facility location, capacitated network design, and multiple knapsack problems.
- IBM (United States) United States
- Cornell University United States
- Université Catholique de Louvain Belgium
mixed integer programming, mixed integer rounding, Gomory mixed integer cuts., Mixed integer programming, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Gomory mixed integer cuts, Mixed integer rounding, mixed integer programming
mixed integer programming, mixed integer rounding, Gomory mixed integer cuts., Mixed integer programming, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Gomory mixed integer cuts, Mixed integer rounding, mixed integer programming
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).116 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!