A dual ascent-based branch-and-bound framework for the prize-collecting steiner tree and related problems
Markus Leitner, Ivana Ljubić, Martin Luipersbeck, Markus Sinnl
| Year of publication: |
2018
|
|---|---|
| Authors: | Leitner, Markus ; Ljubić, Ivana ; Luipersbeck, Martin ; Sinnl, Markus |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 30.2018, 2, p. 402-420
|
| Subject: | Steiner trees | prize-collecting Steiner trees | dual ascent | reduction tests | branch-and-bound | Wettbewerbspolitik | Competition policy | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | USA | United States | Theorie | Theory |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2017.0788 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011878363