Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
Year of publication: |
August 2018
|
---|---|
Authors: | Benchetrit, Yohann ; Fiorini, Samuel ; Huynh, Tony ; Weltge, Stefan |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 43.2018, 3, p. 718-725
|
Subject: | polyhedra | cutting-planes | graphs | integer programming | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Graphentheorie | Graph theory | Ranking-Verfahren | Ranking method |
-
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan, (2014)
-
Mirka, Renee, (2024)
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
- More ...
-
Extension complexity of the correlation polytope
Aboulker, Pierre, (2019)
-
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 ...