A Brief Overview of Interdiction and Robust Optimization
From MaRDI portal
Publication:3299227
DOI10.1007/978-3-030-28565-4_7zbMath1447.91019OpenAlexW2990295872MaRDI QIDQ3299227
J. Cole Smith, Leonardo Lozano
Publication date: 20 July 2020
Published in: Optimization in Large Scale Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-28565-4_7
Hierarchical games (including Stackelberg games) (91A65) 2-person games (91A05) Multistage and repeated games (91A20) Optimality conditions for minimax problems (49K35)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust optimization and portfolio selection: the cost of robustness
- A robust mean absolute deviation model for portfolio optimization
- Robust linear optimization under general norms.
- Evacuation transportation planning under uncertainty: A robust optimization approach
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- Solving the traveling salesman problem with interdiction and fortification
- A dynamic reformulation heuristic for generalized interdiction problems
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Deterministic network interdiction
- Robust optimization-methodology and applications
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Survivable network design under optimal and heuristic interdiction scenarios
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact solution approach for the interdiction median problem with fortification
- Heuristics for multi-stage interdiction of stochastic networks
- Tractable approximations to robust conic optimization problems
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Robust Convex Optimization
- Stochastic Network Interdiction
- Multistage Adaptive Robust Optimization for the Unit Commitment Problem
- Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
- Distributionally Robust Convex Optimization
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Distributionally Robust Optimization and Its Tractable Approximations
- Interdicting a Nuclear-Weapons Project
- Constructing Risk Measures from Uncertainty Sets
- Constructing Uncertainty Sets for Robust Linear Optimization
- Shortest path network interdiction with asymmetric information
- A Robust Optimization Approach to Inventory Theory
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- The Price of Robustness
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- Robust Truss Topology Design via Semidefinite Programming
- A three‐stage procurement optimization problem under uncertainty
- A decomposition algorithm applied to planning the interdiction of stochastic networks
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- A Two-Sided Optimization for Theater Ballistic Missile Defense
- Removing Arcs from a Network
- A Backward Sampling Framework for Interdiction Problems with Fortification
