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)
-
Design of a min-sum arborescence with outage costs
Kawatra, Rakesh, (2013)
-
Optimal network design with end-to-end service requirements
Balakrishnan, Anantaram, (2017)
- More ...
-
A heuristic approach for the distance-based critical node detection problem in complex networks
Alozie, Glory Uche, (2022)
-
Robust formulations for economic lot-sizing problem with remanufacturing
Attila, Öykü Naz, (2021)
-
Matchings with lower quotas: Algorithms and complexity
Arulselvan, Ashwin, (2017)
- More ...