Polynomial-time identification of robust network flows under uncertain arc failures

DOI10.1007/s11590-009-0125-xzbMath1169.90323OpenAlexW2046849669MaRDI QIDQ839810

Clayton W. Commander, Vladimir L. Boginski, Timofey Turko

Publication date: 3 September 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0125-x

zbMATH Keywords

linear programmingnetwork flowsrobust optimizationconditional value-at-riskminimum cost flow problemsquantitative risk measures

Mathematics Subject Classification ID

Linear programming (90C05) Stochastic network models in operations research (90B15)

Related Items (12)

Information theory perspective on network robustness ⋮ On risk-averse maximum weighted subgraph problems ⋮ Conditional value‐at‐risk beyond finance: a survey ⋮ Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs ⋮ Risk‐averse optimization and resilient network flows ⋮ Cooperative maximum-flow problem under uncertainty in logistic networks ⋮ Computational risk management techniques for fixed charge network flow problems with uncertain arc failures ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ Shortest path network problems with stochastic arc weights ⋮ Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios ⋮ On Strategic Defense in Stochastic Networks ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization

Uses Software

• XPRESS

Cites Work

• Robust discrete optimization and network flows
• The wireless network jamming problem
• Stochastic Network Interdiction
• Minimum Cost Routing on Stochastic Networks
• A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
• Maximizing residual flow under an arc destruction
• Maximal Flow in a Multi-Terminal Network with Any One Arc Subject to Failure
• On the history of the transportation and maximum flow problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial-time identification of robust network flows under uncertain arc failures