The minimum cost network upgrade problem with maximum robustness to multiple node failures
Year of publication: |
2021
|
---|---|
Authors: | Barbosa, Fábio ; Agra, Agostinho ; Sousa, Amaro de |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 136.2021, p. 1-16
|
Subject: | Critical node detection | Mixed integer linear programming | Pareto frontier | Robust network design | Telecommunications | Mathematische Optimierung | Mathematical programming | Unternehmensnetzwerk | Business network | Netzwerk | Network | Ganzzahlige Optimierung | Integer programming | Graphentheorie | Graph theory | Telekommunikation |
-
A network simplex method for the budget-constrained minimum cost flow problem
Holzhauser, Michael, (2017)
-
Ricca, Federica, (2024)
-
Finding influential groups in networked systems : the most degree-central clique problem
Zhong, Haonan, (2021)
- More ...
-
Optimizing wind farm cable layout considering ditch sharing
Cerveira, Adelaide, (2024)
-
Prize collecting Steiner trees with node degree dependent costs
Gouveia, Luís, (2011)
-
Gouveia, Luís, (2011)
- More ...