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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Netzwerk | Network | Ganzzahlige Optimierung | Integer programming |
-
Improved formulations for minimum connectivity network interdiction problems
Pavlikov, Konstantin, (2018)
-
Sousa, Amaro de, (2016)
-
Design of a min-sum arborescence with outage costs
Kawatra, Rakesh, (2013)
- More ...
-
Prize collecting Steiner trees with node degree dependent costs
Gouveia, Luís, (2011)
-
Compact models for hop-constrained node survivable network design: an application to MPLS
Gouveia, Luís, (2006)
-
Single PON network design with unconstrained splitting stages
Gouveia, Luís, (2015)
- More ...