On the combinatorial lower bound for the extension complexity of the spanning tree polytope
From MaRDI portal
Publication:2417165
DOI10.1016/j.orl.2018.03.008MaRDI QIDQ2417165
Dirk Oliver Theis, Kaveh Khoshkhah
Publication date: 11 June 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.01424
90-XX: Operations research, mathematical programming