Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
From MaRDI portal
Recommendations
- A bilevel “Attacker–Defender” model to choosing the composition of attack means
- A Backward Sampling Framework for Interdiction Problems with Fortification
- Mixed uncertainty sets for robust combinatorial optimization
- On a class of bilevel linear mixed-integer programs in adversarial settings
- Bilevel `defender-attacker' model with multiple attack scenarios
Cites work
- A Backward Sampling Framework for Interdiction Problems with Fortification
- A class of algorithms for mixed-integer bilevel min-max optimization
- A decomposition algorithm applied to planning the interdiction of stochastic networks
- A dynamic reformulation heuristic for generalized interdiction problems
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A problem in network interdiction
- A robust mean absolute deviation model for portfolio optimization
- A Robust Optimization Approach to Inventory Theory
- A three-stage procurement optimization problem under uncertainty
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Adjustable robust solutions of uncertain linear programs
- Algorithms for network interdiction and fortification games
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Constructing Risk Measures from Uncertainty Sets
- Constructing uncertainty sets for robust linear optimization
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Deterministic network interdiction
- Distributionally Robust Convex Optimization
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Evacuation transportation planning under uncertainty: A robust optimization approach
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Global solution of nonlinear mixed-integer bilevel programs
- Heuristics for multi-stage interdiction of stochastic networks
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 35514 (Why is no real title available?)
- scientific article; zbMATH DE number 6108474 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- Inverse Optimization
- Linear forms of nonlinear expressions: new insights on old ideas
- Maximizing the minimum source-sink path subject to a budget constraint
- Multilevel approaches for the critical node problem
- Multistage adaptive robust optimization for the unit commitment problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Network flows. Theory, algorithms, and applications.
- New analysis and results for the Frank-Wolfe method
- On general minimax theorems
- Online first-order framework for robust convex optimization
- Online learning and online convex optimization
- Oracle-based robust optimization via online learning
- Removing Arcs from a Network
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Robust convex optimization
- Robust discrete optimization and network flows
- Robust linear optimization under general norms.
- Robust optimization
- Robust optimization and portfolio selection: the cost of robustness
- Robust optimization-methodology and applications
- Robust solutions of uncertain linear programs
- Robust Truss Topology Design via Semidefinite Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Sequential interdiction with incomplete information and learning
- Sequential Shortest Path Interdiction with Incomplete Information
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- Shortest path network interdiction with asymmetric information
- Shortest-path network interdiction
- Smooth minimization of non-smooth functions
- Solving the bi-objective maximum-flow network-interdiction problem
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Stochastic network interdiction
- Survivable network design under optimal and heuristic interdiction scenarios
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The inverse optimal value problem
- The Mixed Integer Linear Bilevel Programming Problem
- The Price of Robustness
- The Theory of Max-Min, with Applications
- Tractable approximations to robust conic optimization problems
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Cited in
(4)- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- Two-stage robust optimization approach for enhanced community resilience under tornado hazards
- Data-driven prediction of relevant scenarios for robust combinatorial optimization
This page was built for publication: Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084616)
