The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
Year of publication: |
2016
|
---|---|
Authors: | Ma, Juan ; Mahdavi Pajouh, Foad ; Balasundaram, Balabhaskar ; Boginski, Vladimir |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 28.2016, 2, p. 295-307
|
Subject: | survivable network design | hop constraints | minimum spanning k-core | conditional value-at-risk |
-
On the hop-constrained survivable network design problem with reliable edges
Botton, Quentin, (2014)
-
Extended formulation for hop constrained distribution network configuration problems
De Boeck, Jérôme, (2018)
-
Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM
Gouveia, Luís, (2008)
- More ...
-
A specialty steel bar company uses analytics to determine available-to-promise dates
Mahdavi Pajouh, Foad, (2013)
-
A branch-and-bound approach for maximum quasi-cliques
Mahdavi Pajouh, Foad, (2014)
-
Detecting large risk-averse 2-clubs in graphs with random edge failures
Mahdavi Pajouh, Foad, (2017)
- More ...