Risk‐averse optimization and resilient network flows
From MaRDI portal
(Redirected from Publication:6139370)
Recommendations
- Detecting resilient structures in stochastic networks: A two‐stage stochastic optimization approach
- Network Resilience
- Designing networks with resiliency to edge failures using two-stage robust optimization
- Reserving resilient capacity in a network
- Measuring and maximizing resilience of freight transportation networks
Cites work
- A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
- AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
- Certainty equivalent measures of risk
- Certainty equivalents as risk measures
- Coherent measures of risk
- Connectivity and edge-disjoint spanning trees
- COVID-19: data-driven optimal allocation of ventilator supply under uncertainty and risk
- Decomposition techniques in mathematical programming. Engineering and science applications.
- Designing a supply chain network under the risk of disruptions
- Emergence of Scaling in Random Networks
- Expected Utility, Penalty Functions, and Duality in Stochastic Nonlinear Programming
- Generalized deviations in risk analysis
- Higher moment coherent risk measures
- scientific article; zbMATH DE number 995813 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1766747 (Why is no real title available?)
- scientific article; zbMATH DE number 795214 (Why is no real title available?)
- scientific article; zbMATH DE number 3375221 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Introduction to Stochastic Programming
- Maximum Matching in the Online Batch-arrival Model
- Network flows. Theory, algorithms, and applications.
- Network Optimization Problems: Algorithms, Applications and Complexity
- Optimal attack and reinforcement of a network
- Polynomial-time identification of robust network flows under uncertain arc failures
- Recent developments in maximum flow algorithms
- Reverse logistics network design and planning utilizing conditional value at risk
- Risk-averse multi-stage stochastic optimization for surveillance and operations planning of a forest insect infestation
- Robust discrete optimization and network flows
- Stochastic finance. An introduction in discrete time
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- The -maximum flow model with uncertain capacities
- The fundamental theorem of linear programming: extensions and applications
- Two-Person Zero-Sum Games for Network Interdiction
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
Cited in
(2)
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)
