Notions of maximality for integral lattice-free polyhedra : the case of dimension three
Year of publication: |
November 2017
|
---|---|
Authors: | Averkov, Gennadij ; Krümpelmann, Jan Alexander ; Weltge, Stefan |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 42.2017, 4, p. 1035-1062
|
Subject: | classification | cutting planes | integral polyhedra | lattice-free sets | mixed-integer optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
On the practical strength of two-row tableau cuts
Dey, Santanu S., (2014)
-
Exact and heuristic solution techniques for mixed-integer quantile minimization problems
Cattaruzza, Diego, (2024)
-
Schöbel, Anita, (2014)
- More ...
-
Maximal lattice-free polyhedra : finiteness and an explicit description in dimension three
Averkov, Gennadij, (2011)
-
Improved lower bound on the dimension of the EU council’s voting rules
Kober, Stefan, (2020)
-
Hidden vertices in extensions of polytopes
Pashkovich, Kanstantsin, (2015)
- More ...