On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope-Reference-Cited by-同舟云学术

On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope

Published:2018-05 Issue:3 Volume:46 Page:352-355
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Khoshkhah Kaveh,Theis Dirk Oliver

Funder

Estonian Research Council, ETAG

European Regional Development Fund

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference13 articles.

1. Jack Edmonds, Submodular functions, matroids, and certain polyhedra. G. Goos, J. Hartmanis, and J. van Leeuwen (Eds.), Vol. 11, 1970.

2. Extended formulations, nonnegative factorizations, and randomized communication protocols;Faenza,2012

3. Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich, Smaller extended formulations for the spanning tree polytope of bounded-genus graphs. Preprint arXiv:1604.07976, 2016.

4. Combinatorial bounds on nonnegative rank and extended formulations;Fiorini;Discrete Math.,2013

5. Exponential lower bounds for polytopes in combinatorial optimization;Fiorini;J. ACM,2015

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extended formulations for matroid polytopes through randomized protocols;Operations Research Letters;2022-03

2. Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond;The Electronic Journal of Combinatorics;2021-12-17

3. Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes;Operations Research Letters;2021-11

4. Fundamental limitations;Introduction to Linear Control Systems;2019