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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Oktay Günlük / rank
Normal rank
 
Property / author
 
Property / author: Oktay Günlük / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities from Two Rows of a Simplex Tableau / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4067292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Lattice-Free Convex Sets in Linear Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: New volume ratio properties for convex symmetric bodies in \({\mathbb{R}}^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal closures for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mixed-integer sets with two integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(t\)-branch split cuts for mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rank of Disjunctive Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two row mixed-integer cuts via lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blowing up convex sets in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering minima and lattice-point-free convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5785796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the Mahler conjecture to Gauss linking integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cook, Kannan and Schrijver's example revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A disjunctive cutting plane procedure for general mixed-integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances between non-symmetric convex bodies and the \(MM^*\)-estimate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 16:12, 8 July 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
    0 references
    0 references
    0 references
    0 references

    Identifiers