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

2018 ◽  
Vol 30 (2) ◽  
pp. 402-420 ◽  
Author(s):  
Markus Leitner ◽  
Ivana Ljubić ◽  
Martin Luipersbeck ◽  
Markus Sinnl
Keyword(s):  
Branch And Bound ◽  
Steiner Tree ◽  
Dual Ascent ◽  
Prize Collecting

The Fractional Prize-Collecting Steiner Tree Problem on Trees

2003 ◽  
pp. 691-702 ◽  
Author(s):  
Gunnar W. Klau ◽  
Ivana Ljubić ◽  
Petra Mutzel ◽  
Ulrich Pferschy ◽  
René Weiskircher
Keyword(s):  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Prize Collecting

scholarly journals Algorithmic expedients for the Prize Collecting Steiner Tree Problem

2010 ◽  
Vol 7 (1-2) ◽  
pp. 32-47 ◽  
Author(s):  
Mohamed Haouari ◽  
Safa Bhar Layeb ◽  
Hanif D. Sherali
Keyword(s):  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Prize Collecting
Sign in / Sign up

Export Citation Format

Share Document