Heuristic and exact algorithms for minimum-weight non-spanning arborescences
Year of publication: |
2020
|
---|---|
Authors: | Ritt, Marcus ; Pereira, Jordi |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 287.2020, 1 (18.11.), p. 61-75
|
Subject: | Branch-and-cut | Heuristic | Iterated Local Search | Minimum-weight non-spanning arborescence | Heuristik | Heuristics | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A lean optimization algorithm for water distribution network design optimization
De Corte, Annelies, (2015)
-
Well-tuned algorithms for the Team Orienteering Problem with Time Windows
Gunawan, Aldy, (2017)
-
Silva, Yuri Laio T. V., (2018)
- More ...
-
A memetic algorithm for the cost-oriented robotic assembly line balancing problem
Pereira, Jordi, (2018)
-
A note on "algorithms for the Calzedonia workload allocation problem"
Pereira, Jordi, (2022)
-
Exact and heuristic methods for a workload allocation problem with chain precedence constraints
Pereira, Jordi, (2023)
- More ...