A dual ascent-based branch-and-bound framework for the prize-collecting steiner tree and related problems
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 |
-
A branch-and-bound algortihm for the cell formation problem
Utkina, Irina E., (2018)
-
Exact algorithms for the solution of the grey pattern quadratic assignment problem
Drezner, Zvi, (2015)
-
Multi-objective branch and bound
Przybylski, Anthony, (2017)
- More ...
-
Solving minimum-cost shared arborescence problems
Álvarez-Miranda, Eduardo, (2017)
-
ILP heuristics and a new exact method for bi-objective 0/1 ILPs : application to FTTx-network design
Leitner, Markus, (2016)
-
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
Leitner, Markus, (2015)
- More ...