A Dual Ascent-Based Branch-and-Bound Framework for the...

INFORMS Journal on Computing 2018 / 05 Vol. 30; Iss. 2

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

Leitner, Markus, Ljubić, Ivana, Luipersbeck, Martin, Sinnl, Markus
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
30
Language:
english
Journal:
INFORMS Journal on Computing
DOI:
10.1287/ijoc.2017.0788
Date:
May, 2018
File:
PDF, 625 KB
english, 2018
Conversion to is in progress
Conversion to is failed