BibTeX record journals/networks/CaccettaH01

download as .bib file

@article{DBLP:journals/networks/CaccettaH01,
  author       = {Lou Caccetta and
                  Stephen P. Hill},
  title        = {A branch and cut method for the degree-constrained minimum spanning
                  tree problem},
  journal      = {Networks},
  volume       = {37},
  number       = {2},
  pages        = {74--83},
  year         = {2001},
  url          = {https://doi.org/10.1002/1097-0037(200103)37:2\<74::AID-NET2\>3.0.CO;2-E},
  doi          = {10.1002/1097-0037(200103)37:2\<74::AID-NET2\>3.0.CO;2-E},
  timestamp    = {Sun, 28 May 2017 13:19:53 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/CaccettaH01.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.