BibTeX record journals/networks/FeremansLL04

download as .bib file

@article{DBLP:journals/networks/FeremansLL04,
  author       = {Corinne Feremans and
                  Martine Labb{\'{e}} and
                  Gilbert Laporte},
  title        = {The generalized minimum spanning tree problem: Polyhedral analysis
                  and branch-and-cut algorithm},
  journal      = {Networks},
  volume       = {43},
  number       = {2},
  pages        = {71--86},
  year         = {2004},
  url          = {https://doi.org/10.1002/net.10105},
  doi          = {10.1002/NET.10105},
  timestamp    = {Sat, 19 Oct 2019 19:03:53 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/FeremansLL04.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.