Detecting resilient structures in stochastic networks: A two‐stage stochastic optimization approach

DOI10.1002/NET.21727zbMATH Open1390.90121OpenAlexW2582333572MaRDI QIDQ4565783FDOQ4565783

Authors: Maciej Rysz, Eduardo L. Pasiliao, Pavlo A. Krokhmal 

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21727

Recommendations

• Detecting the topologies of complex networks with stochastic perturbations
• Resilience for stochastic systems interacting via a quasi-degenerate network
• Estimating and increasing the structural robustness of a network
• A characterization of stochastically stable networks
• scientific article; zbMATH DE number 4149869
• Networks that optimize a trade-off between efficiency and dynamical resilience

zbMATH Keywords

stochastic graphsmaximum subgraph problemtwo-stage stochastic optimizationcombinatorial branch-and-bound algorithmresilience of subgraphsstochastic maximum clique problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Stochastic programming (90C15)

Cited In (4)

• QRF
• Risk‐averse optimization and resilient network flows
• A generic optimization framework for resilient systems
• Network reliability: Heading out on the highway

This page was built for publication: Detecting resilient structures in stochastic networks: A two‐stage stochastic optimization approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565783)