Exact algorithms for the minimum cost vertex blocker clique problem
Year of publication: |
2019
|
---|---|
Authors: | Nasirian, Farzaneh ; Mahdavi Pajouh, Foad ; Namayanja, Josephine |
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. 103.2019, p. 296-309
|
Subject: | Minimum cost vertex blocker clique problem | Interdiction | Lazy-fashioned branch-and-cut | Combinatorial branch-and-bound | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
A bilevel hierarchical covering model to protect a healthcare network against failures
Khanduzi, Raheleh, (2024)
-
Best response intersection : an optimal algorithm for interdiction defense
Mastin, Andrew, (2023)
-
Interdicting structured combinatorial optimization problems with {0, 1}-objectives
Chestnut, Stephen R., (2017)
- More ...
-
Detecting a most closeness-central clique in complex networks
Nasirian, Farzaneh, (2020)
-
Integer programming formulations for minimum spanning tree interdiction
Wei, Ningji, (2021)
-
Detecting large risk-averse 2-clubs in graphs with random edge failures
Mahdavi Pajouh, Foad, (2017)
- More ...