An algorithmic framework for the exact solution of tree-star problems
Year of publication: |
16 August 2017
|
---|---|
Authors: | Leitner, Markus ; Ljubić, Ivana ; Salazar-González, Juan-José ; Sinnl, Markus |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 261.2017, 1 (16.8.), p. 54-66
|
Subject: | Combinatorial optimization | Connected facility location | Branch-and-cur | Dual ascent | Benders decomposition | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dekompositionsverfahren | Decomposition method | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
Naderi, Bahman, (2020)
-
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
Sinnl, Markus, (2022)
-
Sun, Peter, (2014)
- More ...
-
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
Leitner, Markus, (2015)
-
ILP heuristics and a new exact method for bi-objective 0/1 ILPs : application to FTTx-network design
Leitner, Markus, (2016)
-
Leitner, Markus, (2018)
- More ...