BibTeX record journals/networks/PereiraC18

download as .bib file

@article{DBLP:journals/networks/PereiraC18,
  author       = {Dilson Lucas Pereira and
                  Alexandre Salles da Cunha},
  title        = {Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms
                  for the adjacent only quadratic minimum spanning tree problem},
  journal      = {Networks},
  volume       = {71},
  number       = {1},
  pages        = {31--50},
  year         = {2018},
  url          = {https://doi.org/10.1002/net.21787},
  doi          = {10.1002/NET.21787},
  timestamp    = {Fri, 05 Jan 2018 15:53:46 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/PereiraC18.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.