A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Constraints

Published in Math. Program. Comput. 8(4): 461-490, 2016

View paper here

Bibtex:

@article{DBLP:journals/mpc/SinnlL16,
  author    = {Markus Sinnl and
               Ivana Ljubic},
  title     = {A node-based layered graph approach for the Steiner tree problem with
               revenues, budget and hop-constraints},
  journal   = {Math. Program. Comput.},
  volume    = {8},
  number    = {4},
  pages     = {461--490},
  year      = {2016},
  url       = {https://doi.org/10.1007/s12532-016-0102-1},
  doi       = {10.1007/s12532-016-0102-1},
  timestamp = {Tue, 04 Feb 2020 18:05:57 +0100},
  biburl    = {https://dblp.org/rec/journals/mpc/SinnlL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}