Ivana LJUBIC

Ivana LJUBIC

Professor of Operations Research at the ESSEC Business School

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

Published in INFORMS J. Comput. 30(2): 402-420, 2018

View paper here

Download paper here

Bibtex:

@article{DBLP:journals/informs/LeitnerLLS18,
  author    = {Markus Leitner and
               Ivana Ljubic and
               Martin Luipersbeck and
               Markus Sinnl},
  title     = {A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting
               Steiner Tree and Related Problems},
  journal   = { {INFORMS} J. Comput.},
  volume    = {30},
  number    = {2},
  pages     = {402--420},
  year      = {2018},
  url       = {https://doi.org/10.1287/ijoc.2017.0788},
  doi       = {10.1287/ijoc.2017.0788},
  timestamp = {Sun, 15 Mar 2020 19:45:18 +0100},
  biburl    = {https://dblp.org/rec/journals/informs/LeitnerLLS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}