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

Markus Leitner et al. (2018)

> Home

Details and statistics

DOI: 10.1287/IJOC.2017.0788

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/LeitnerLLS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/LeitnerLLS18
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 J. Comput. 30(2): 402-420 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.