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

Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl. A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. INFORMS Journal on Computing, 30(2):402-420, 2018. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: