Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions

DOI10.1287/IJOC.2022.1243MaRDI QIDQ6121580zbMATH OpenOpenAlexFDO

Authors Juan S. Borrero, Leonardo Lozano

Publication date 27 February 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2022.1243

zbMATH Keywords

cut-generationdefender-attacker problemsmaximal covering location problemminimum-cost flow problemripple effect disruptionsrobust optimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Robust and adaptive network flows
• Robust minimum cost flow problem under consistent flow constraints
• Robust discrete optimization and network flows
• Complexity of strict robust integer minimum cost flow problems: an overview and further results
• Minimizing recovery cost of network optimization problems

Cited in

(3)

• Robust flows with adaptive mitigation
• Two-stage nodal network interdiction under decision-dependent uncertainty
• Two-stage robust optimization approach for enhanced community resilience under tornado hazards

This page was built for publication: Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions

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