Regular matroids have polynomial extension complexity
Year of publication: |
2022
|
---|---|
Authors: | Aprile, Manuel ; Fiorini, Samuel |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 47.2022, 1, p. 540-559
|
Subject: | cut dominant | extended formulations | independence polytope | regular matroids | spanning tree polytope | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Extended formulations for matroid polytopes through randomized protocols
Aprile, Manuel, (2022)
-
Subgraph polytopes and independence polytopes of count matroids
Conforti, Michele, (2015)
-
Brugger, Matthias, (2021)
- More ...
-
Graph fragmentation problem: analysis and synthesis
Aprile, Manuel, (2018)
-
Binary extended formulations and sequential convexification
Aprile, Manuel, (2024)
-
Extended formulations for matroid polytopes through randomized protocols
Aprile, Manuel, (2022)
- More ...