On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope
Year of publication: |
May 2018
|
---|---|
Authors: | Khoshkhah, Kaveh ; Theis, Dirk |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 46.2018, 3, p. 352-355
|
Subject: | Extension complexity | Communication complexity | Spanning Tree Polytope | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Komplexitätsmanagement | Complexity management | Komplexe Systeme | Complex systems |
-
Full complexity analysis of the diameter-constrained reliability
Canale, Eduardo, (2015)
-
Extension complexity of the correlation polytope
Aboulker, Pierre, (2019)
-
The critical complexity of graph properties
Turán, György, (1983)
- More ...
-
Erdmann, Burkhard, (2005)
-
Compact formulations of the Steiner Traveling Salesman Problem and related problems
Letchford, Adam N., (2013)
- More ...