Extension complexity of the correlation polytope
Year of publication: |
2019
|
---|---|
Authors: | Aboulker, Pierre ; Fiorini, Samuel ; Huynh, Tony ; Macchia, Marco ; Seif, Johanna |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 47.2019, 1, p. 47-51
|
Subject: | Correlation polytope | Graph minors | Extension complexity | Treewidth | Machine learning | Künstliche Intelligenz | Artificial intelligence | Korrelation | Correlation | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Komplexitätsmanagement | Complexity management |
-
Liang, Yile, (2024)
-
On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope
Khoshkhah, Kaveh, (2018)
-
A machine learning approach for predicting hidden links in supply chain with graph neural networks
Kosasih, Edward Elson, (2022)
- More ...
-
Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
Benchetrit, Yohann, (2018)
-
Procedural Decision-Making and the Banking Union : The Accountability Mechanisms
Macchia, Marco, (2017)
-
Fiorini, Samuel, (2007)
- More ...