Subgraph polytopes and independence polytopes of count matroids
Year of publication: |
2015
|
---|---|
Authors: | Conforti, Michele ; Kaibel, Volker ; Walter, Matthias ; Weltge, Stefan |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 5, p. 457-460
|
Subject: | Extension complexity | Spanning tree polytope | Count matroids | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Brugger, Matthias, (2021)
-
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 ...
-
Optimality certificates for convex minimization and Helly numbers
Basu, Amitabh, (2017)
-
Conforti, Michele, (2025)
-
Extended formulations for radial cones
Walter, Matthias, (2019)
- More ...