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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Interdicting structured combinatorial optimization problems with {0, 1}-objectives
Chestnut, Stephen R., (2017)
-
Best response intersection : an optimal algorithm for interdiction defense
Mastin, Andrew, (2023)
-
Finding clique clusters with the highest betweenness centrality
Rysz, Maciej, (2018)
- More ...
-
Detecting a most closeness-central clique in complex networks
Nasirian, Farzaneh, (2020)
-
Criticality index analysis based optimal RFID reader placement models for asset tracking
Oztekin, Asil, (2010)
-
An RFID network design methodology for asset tracking in healthcare
Oztekin, Asil, (2010)
- More ...