On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope
From MaRDI portal
Publication:6282824
DOI10.1016/j.orl.2018.03.008zbMath1525.90441arXiv1702.01424WikidataQ130034043 ScholiaQ130034043MaRDI QIDQ6282824
Kaveh Khoshkhah, Dirk Oliver Theis
Publication date: 5 February 2017
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
This page was built for publication: On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope