Solving minimum-cost shared arborescence problems
Year of publication: |
1 May 2017
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Ljubić, Ivana ; Luipersbeck, Martin ; Sinnl, Markus |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 258.2017, 3 (1.5.), p. 887-901
|
Subject: | Combinatorial optimization | Benders decomposition | Integer programming | Telecommunications | Bioinformatics | Theorie | Theory | Telekommunikation | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Scheduling-Verfahren | Scheduling problem | Dekompositionsverfahren | Decomposition method |
-
Decomposition based hybrid metaheuristics
Raidl, Günther, (2015)
-
Naderi, Bahman, (2020)
-
Combinatorial Benders cuts for assembly line balancing problems with setups
Akpinar, Sener, (2017)
- More ...
-
Gotta (efficiently) catch them all : Pokémon GO meets orienteering problems
Álvarez-Miranda, Eduardo, (2018)
-
Álvarez-Miranda, Eduardo, (2017)
-
Leitner, Markus, (2018)
- More ...