Minimum edge blocker dominating set problem
Year of publication: |
2015
|
---|---|
Authors: | Mahdavi Pajouh, Foad ; Walteros, Jose L. ; Boginski, Vladimir ; Pasiliao, Eduardo L. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 247.2015, 1 (1.11.), p. 16-26
|
Subject: | Network interdiction | Minimum weighted dominating set | NP-hardness | Branch-and-cut algorithm | Critical elements detection | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Wu, Lebao, (2023)
-
Discrete cutting path problems : a general solution framework and industrial applications
Khachai, Daniil, (2025)
-
Groiez, Mounira, (2013)
- More ...
-
Integer programming formulations for minimum spanning tree interdiction
Wei, Ningji, (2021)
-
The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
Ma, Juan, (2016)
-
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
Rysz, Maciej, (2018)
- More ...