Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes
Year of publication: |
2021
|
---|---|
Authors: | Brugger, Matthias |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 6, p. 896-901
|
Subject: | Completion time polytope | Extension complexity | Graphic zonotope | Hyperplane separation bound | Slack matrix | Spanning tree polytope | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Subgraph polytopes and independence polytopes of count matroids
Conforti, Michele, (2015)
-
On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope
Khoshkhah, Kaveh, (2018)
-
Regular matroids have polynomial extension complexity
Aprile, Manuel, (2022)
- More ...
-
On the complexity of recognizing integrality and total dual integrality of the {0,1/2}-closure
Brugger, Matthias, (2022)
- More ...