Risk‐averse optimization and resilient network flows

Cites Work

Network flows. Theory, algorithms, and applications.
Title not available (Why is that?)
Coherent measures of risk
Emergence of Scaling in Random Networks
Title not available (Why is that?)
Generalized deviations in risk analysis
Title not available (Why is that?)
Stochastic finance. An introduction in discrete time
Robust discrete optimization and network flows
Introduction to Stochastic Programming
Higher moment coherent risk measures
AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
Designing a supply chain network under the risk of disruptions
Title not available (Why is that?)
Two-Person Zero-Sum Games for Network Interdiction
Decomposition techniques in mathematical programming. Engineering and science applications.
Reverse logistics network design and planning utilizing conditional value at risk
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Polynomial-time identification of robust network flows under uncertain arc failures
Title not available (Why is that?)
Certainty equivalents as risk measures
Optimal attack and reinforcement of a network
Expected Utility, Penalty Functions, and Duality in Stochastic Nonlinear Programming
A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
Connectivity and edge-disjoint spanning trees
Title not available (Why is that?)
Certainty equivalent measures of risk
Network Optimization Problems: Algorithms, Applications and Complexity
The \(\alpha\)-maximum flow model with uncertain capacities
The fundamental theorem of linear programming: extensions and applications
Recent developments in maximum flow algorithms
Stochastic maximum flow interdiction problems under heterogeneous risk preferences
COVID-19: data-driven optimal allocation of ventilator supply under uncertainty and risk
Risk-averse multi-stage stochastic optimization for surveillance and operations planning of a forest insect infestation
Title not available (Why is that?)
Maximum Matching in the Online Batch-arrival Model
Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms

Cited In (1)

Deterministic risk control for cost-effective network connections

This page was built for publication: Risk‐averse optimization and resilient network flows

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