Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-013-0654-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157274017 / rank
 
Normal rank

Revision as of 00:25, 20 March 2024

scientific article
Language Label Description Also known as
English
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
scientific article

    Statements

    Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 June 2014
    0 references
    This paper proves that for every integer \(n\) there exists a positive integer \(t\) such that every facet-defining inequality of the convex hull of a mixed integer polyhedral set with \(n\) integer variables is a \(t\)-branch split cut. This result is used to derive a finite cutting-plane algorithm to solve mixed integer programs. The authors also show that the minimum value of \(t\) for which the result holds grows exponentially with \(n\).
    0 references
    mixed integer programming
    0 references
    valid inequalities
    0 references
    lattice-free sets
    0 references
    multi-branch split disjunctions
    0 references

    Identifiers