A brief overview of interdiction and robust optimization

DOI10.1007/978-3-030-28565-4_7zbMATH Open1447.91019OpenAlexW2990295872MaRDI QIDQ3299227FDOQ3299227

Authors: Leonardo Lozano, J. Cole Smith 

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

Recommendations

• A survey of network interdiction models and algorithms
• Algorithms for network interdiction and fortification games
• Hierarchical optimization: An introduction
• Shortest path interdiction problem with arc improvement recourse: A multiobjective approach
• A robust optimization approach for solving two-person games under interval uncertainty

zbMATH Keywords

robust optimizationnetwork interdictiontwo-player zero-sum Stackelberg games

Mathematics Subject Classification ID

2-person games (91A05) Optimality conditions for minimax problems (49K35) Multistage and repeated games (91A20) Hierarchical games (including Stackelberg games) (91A65)

Cites Work

• A bilevel mixed-integer program for critical infrastructure protection planning
• Constructing Risk Measures from Uncertainty Sets
• Robust optimization
• The Price of Robustness
• A Two-Sided Optimization for Theater Ballistic Missile Defense
• Robust solutions of uncertain linear programs
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Distributionally robust optimization under moment uncertainty with application to data-driven problems
• Constructing uncertainty sets for robust linear optimization
• Robust linear optimization under general norms.
• Evacuation transportation planning under uncertainty: A robust optimization approach
• Deterministic network interdiction
• Robust optimization-methodology and applications
• Robust convex optimization
• Distributionally robust optimization and its tractable approximations
• Removing Arcs from a Network
• Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
• Robust Truss Topology Design via Semidefinite Programming
• Adjustable robust solutions of uncertain linear programs
• Stochastic network interdiction
• A decomposition algorithm applied to planning the interdiction of stochastic networks
• Two-Person Zero-Sum Games for Network Interdiction
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• An exact solution approach for the interdiction median problem with fortification
• Tractable approximations to robust conic optimization problems
• A Robust Optimization Approach to Inventory Theory
• Robust optimization and portfolio selection: the cost of robustness
• Shortest-path network interdiction
• A dynamic reformulation heuristic for generalized interdiction problems
• Solving the bi-objective maximum-flow network-interdiction problem
• Shortest path network interdiction with asymmetric information
• Maximizing the minimum source-sink path subject to a budget constraint
• Title not available (Why is that?)
• Survivable network design under optimal and heuristic interdiction scenarios
• A problem in network interdiction
• Heuristics for multi-stage interdiction of stochastic networks
• Interdicting a Nuclear-Weapons Project
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• Algorithms for network interdiction and fortification games
• Multistage adaptive robust optimization for the unit commitment problem
• A robust mean absolute deviation model for portfolio optimization
• Distributionally Robust Convex Optimization
• Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
• A Backward Sampling Framework for Interdiction Problems with Fortification
• Solving the traveling salesman problem with interdiction and fortification
• A three-stage procurement optimization problem under uncertainty

Cited In (2)

• A Backward Sampling Framework for Interdiction Problems with Fortification
• Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption

Uses Software

• ROME

This page was built for publication: A brief overview of interdiction and robust optimization

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