A Backward Sampling Framework for Interdiction Problems with Fortification
From MaRDI portal
Publication:5739135
DOI10.1287/IJOC.2016.0721zbMath1414.91086OpenAlexW2563147102MaRDI QIDQ5739135
Leonardo Lozano, J. Cole Smith
Publication date: 2 June 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2016.0721
Hierarchical games (including Stackelberg games) (91A65) 2-person games (91A05) Multistage and repeated games (91A20) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items (24)
Complexity of the multilevel critical node problem ⋮ Interdicting facilities in tree networks ⋮ A generic optimization framework for resilient systems ⋮ A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ An iterative security game for computing robust and adaptive network flows ⋮ Integer programming methods for solving binary interdiction games ⋮ An exact bidirectional pulse algorithm for the constrained shortest path ⋮ Interdicting restructuring networks with applications in illicit trafficking ⋮ Robust flows with adaptive mitigation ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ An exact method for binary fortification games ⋮ A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem ⋮ Solving the traveling salesman problem with interdiction and fortification ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks ⋮ A sampling-based exact algorithm for the solution of the minimax diameter clustering problem ⋮ An enhanced branch-and-bound algorithm for bilevel integer linear programming ⋮ An optimal algorithm for variable knockout problems ⋮ The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms ⋮ Multilevel Approaches for the Critical Node Problem ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
Uses Software
This page was built for publication: A Backward Sampling Framework for Interdiction Problems with Fortification
