Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
From MaRDI portal
Publication:5084616
DOI10.1287/ijoc.2020.1041OpenAlexW3129302784MaRDI QIDQ5084616
Leonardo Lozano, Juan S. Borrero
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1041
robust optimizationbilevel optimizationFrank-Wolfe algorithmmixed integer optimizationcut generationdefender attacker
Related Items
A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A class of algorithms for mixed-integer bilevel min-max optimization
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Robust optimization and portfolio selection: the cost of robustness
- A robust mean absolute deviation model for portfolio optimization
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Robust linear optimization under general norms.
- On general minimax theorems
- Evacuation transportation planning under uncertainty: A robust optimization approach
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A dynamic reformulation heuristic for generalized interdiction problems
- The inverse optimal value problem
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Deterministic network interdiction
- Robust optimization-methodology and applications
- Global solution of nonlinear mixed-integer bilevel programs
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Linear forms of nonlinear expressions: new insights on old ideas
- Survivable network design under optimal and heuristic interdiction scenarios
- 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
- Constructing Risk Measures from Uncertainty Sets
- Constructing Uncertainty Sets for Robust Linear Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- Online Learning and Online Convex 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
- Oracle-Based Robust Optimization via Online Learning
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Inverse Optimization
- The Price of Robustness
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- Robust Truss Topology Design via Semidefinite Programming
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- A three‐stage procurement optimization problem under uncertainty
- A decomposition algorithm applied to planning the interdiction of stochastic networks
- Sequential Shortest Path Interdiction with Incomplete Information
- Shortest-path network interdiction
- Sequential Interdiction with Incomplete Information and Learning
- Multilevel Approaches for the Critical Node Problem
- Online First-Order Framework for Robust Convex Optimization
- Bilevel Programming Problems
- The Mixed Integer Linear Bilevel Programming Problem
- The Theory of Max-Min, with Applications
- Removing Arcs from a Network
- A Backward Sampling Framework for Interdiction Problems with Fortification
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- New analysis and results for the Frank-Wolfe method
