Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set
From MaRDI portal
Publication:6179697
DOI10.1002/net.22114zbMath1529.90022MaRDI QIDQ6179697
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
decomposition algorithmdistributionally robust optimizationstochastic network interdictiondistributionally risk-receptivegeneral ambiguity set
Programming involving graphs or networks (90C35) Stochastic programming (90C15) Stochastic network models in operations research (90B15)
Cites Work
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- Identifying effective scenarios in distributionally robust stochastic programs with total variation distance
- The maximum clique interdiction problem
- Deterministic network interdiction
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- Network interdiction with asymmetric cost uncertainty
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A bilevel mixed-integer program for critical infrastructure protection planning
- Stochastic Network Interdiction
- Risk-Averse Shortest Path Interdiction
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Minimizing a stochastic maximum-reliability path
- Reformulation and sampling to solve a stochastic network interdiction problem
- Shortest path network interdiction with asymmetric information
- The Price of Robustness
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Deception tactics for network interdiction: A multiobjective approach
- A decomposition algorithm applied to planning the interdiction of stochastic networks
- The minimax approach to stochastic programming and an illustrative application
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- Mitigating Interdiction Risk with Fortification
- Ambiguity in portfolio selection
- Attacker–defender models and road network vulnerability
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Removing Arcs from a Network
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
This page was built for publication: Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set