Efficient methods for the distance-based critical node detection problem in complex networks
Year of publication: |
2021
|
---|---|
Authors: | Alozie, Glory Uche ; Arulselvan, Ashwin ; Akartunalı, Kerem ; Pasiliao, Eduardo L. |
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. 131.2021, p. 1-13
|
Subject: | Breadth first search | Critical node problem | Distance connectivity | Integer programming | Lazy constraints | Theorie | Theory | Ganzzahlige Optimierung | Netzwerk | Network | Mathematische Optimierung | Mathematical programming |
-
Multilevel approaches for the critical node problem
Baggio, Andrea, (2021)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
Chance-constrained optimization of reliable fixed broadband wireless networks
Claßen, Grit, (2014)
- More ...
-
A heuristic approach for the distance-based critical node detection problem in complex networks
Alozie, Glory Uche, (2022)
-
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
Rysz, Maciej, (2018)
-
Finding clique clusters with the highest betweenness centrality
Rysz, Maciej, (2018)
- More ...