A dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
Date:
This talk was part of Journées Polyèdres et Optimisation Combinatoire JPOC10.
Ivana LJUBIC
Professor of Operations Research at the ESSEC Business School
- Paris, France
- Google Scholar
- ORCID