Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/informs/LeitnerLLS18
%A Leitner, Markus
%A Ljubic, Ivana
%A Luipersbeck, Martin
%A Sinnl, Markus
%D 2018
%J INFORMS J. Comput.
%K dblp
%N 2
%P 402-420
%T A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.
%U http://dblp.uni-trier.de/db/journals/informs/informs30.html#LeitnerLLS18
%V 30
@article{journals/informs/LeitnerLLS18,
added-at = {2020-03-15T00:00:00.000+0100},
author = {Leitner, Markus and Ljubic, Ivana and Luipersbeck, Martin and Sinnl, Markus},
biburl = {https://www.bibsonomy.org/bibtex/28070ac4e7c566bd8dbfb2da7c9f31a8a/dblp},
ee = {https://www.wikidata.org/entity/Q57705346},
interhash = {8b340157bf92e0a34d05e23221b0402e},
intrahash = {8070ac4e7c566bd8dbfb2da7c9f31a8a},
journal = {INFORMS J. Comput.},
keywords = {dblp},
number = 2,
pages = {402-420},
timestamp = {2020-03-17T11:38:58.000+0100},
title = {A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.},
url = {http://dblp.uni-trier.de/db/journals/informs/informs30.html#LeitnerLLS18},
volume = 30,
year = 2018
}