BibTeX record journals/orl/KhoshkhahT18

download as .bib file

@article{DBLP:journals/orl/KhoshkhahT18,
  author       = {Kaveh Khoshkhah and
                  Dirk Oliver Theis},
  title        = {On the combinatorial lower bound for the extension complexity of the
                  Spanning Tree polytope},
  journal      = {Oper. Res. Lett.},
  volume       = {46},
  number       = {3},
  pages        = {352--355},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.orl.2018.03.008},
  doi          = {10.1016/J.ORL.2018.03.008},
  timestamp    = {Mon, 11 Jun 2018 15:15:56 +0200},
  biburl       = {https://dblp.org/rec/journals/orl/KhoshkhahT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.