Login / Signup
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
Published in:
INFORMS J. Comput. (2018)
Keyphrases
</>
related problems
branch and bound
lower bound
column generation
branch and bound algorithm
branch and bound procedure
upper bound
lagrangian heuristic
search algorithm
combinatorial optimization
probabilistic model
search space
search strategy
worst case
tree search
branch and bound method
prize collecting