A survey of network interdiction models and algorithms
From MaRDI portal
Publication:2294622
DOI10.1016/j.ejor.2019.06.024zbMath1441.90048OpenAlexW2951543070WikidataQ127651690 ScholiaQ127651690MaRDI QIDQ2294622
Publication date: 11 February 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.06.024
decomposition algorithmsnetworksmixed integer programming formulationsnetwork interdictionmin-max games
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)
Related Items
Interdicting facilities in tree networks ⋮ A generic optimization framework for resilient systems ⋮ Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal ⋮ A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ A bilevel optimization approach to decide the feasibility of bookings in the European gas market ⋮ SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ A Markov decision process model on dynamic routing for target surveillance ⋮ A data-driven matching algorithm for ride pooling problem ⋮ Integer programming methods for solving binary interdiction games ⋮ Predicting wildlife trafficking routes with differentiable shortest paths ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows ⋮ A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem ⋮ Logic-based Benders decomposition for wildfire suppression ⋮ Exact solution approaches for a class of bilevel fractional programs ⋮ Shortest path interdiction problem with convex piecewise-linear costs ⋮ A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints ⋮ The stochastic critical node problem over trees ⋮ A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid ⋮ A survey on bilevel optimization under uncertainty ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ Interdicting restructuring networks with applications in illicit trafficking ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Parametric matroid interdiction ⋮ On robustness in nonconvex optimization with application to defense planning ⋮ An exact method for binary fortification games ⋮ Optimization strategies for the bilevel network design problem with affine cost functions ⋮ Mathematical programming formulations for the collapsed k-core problem ⋮ A two‐stage network interdiction‐monitoring game ⋮ Robust capacitated Steiner trees and networks with uniform demands ⋮ Attack and interception in networks ⋮ Shortest path network interdiction with asymmetric uncertainty ⋮ The minmax regret inverse maximum weight problem ⋮ A bi-level model and memetic algorithm for arc interdiction location-routing problem ⋮ Improving connectivity of compromised digital networks via algebraic connectivity maximisation ⋮ Minimum \(k\)-critical bipartite graphs ⋮ The continuous maximum capacity path interdiction problem ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback ⋮ OR for entrepreneurial ecosystems: a problem-oriented review and agenda
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infrastructure security games
- 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
- Matching interdiction
- Interdicting nuclear material on cargo containers using knapsack problem models
- Data-driven inverse optimization with imperfect information
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- Bilevel programming and applications
- Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications
- Deterministic network interdiction
- Finding the most vital arcs in a network
- New variants of bundle methods
- Global solution of nonlinear mixed-integer bilevel programs
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Convex hull representation of the deterministic bipartite network interdiction problem
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Dynamic games in cyber-physical security: an overview
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Survivable network design under optimal and heuristic interdiction scenarios
- Restricted-Recourse Bounds for Stochastic Linear Programming
- Stochastic Network Interdiction
- Reverse 1-center problem on weighted trees
- Risk-Averse Shortest Path Interdiction
- Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
- Interdicting a Nuclear-Weapons Project
- Optimal Thresholds for Anomaly-Based Intrusion Detection in Dynamical Environments
- Minimizing a stochastic maximum-reliability path
- Reformulation and sampling to solve a stochastic network interdiction problem
- Shortest path network interdiction with asymmetric information
- Bilevel Knapsack with Interdiction Constraints
- Maximal Flow Through a Network
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Balancing Terrorism and Natural Disasters—Defensive Strategy with Endogenous Attacker Effort
- Inverse Optimization
- The Price of Robustness
- Lectures on Stochastic Programming
- New product introduction against a predator: A bilevel mixed-integer programming approach
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Finding the n Most Vital Links in Flow Networks
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- Securing a border under asymmetric information
- Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
- Exact algorithms and bounds for the dynamic assignment interdiction problem
- Dynamic shortest‐path interdiction
- Minimum vertex blocker clique problem
- Deception tactics for network interdiction: A multiobjective approach
- Sequential Shortest Path Interdiction with Incomplete Information
- Modeling a Multitarget Attacker–Defender Game with Budget Constraints
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- Inverse Optimization with Noisy Data
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- The network inhibition problem
- Attack Detection and Identification in Cyber-Physical Systems
- Prediction, Learning, and Games
- Removing Arcs from a Network
- Optimal interdiction policy for a flow network
- Optimal interdiction of a supply network
- Utility Theory without the Completeness Axiom
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- The mixed vertex packing problem.
- Concavity cuts for disjoint bilinear programming
- Mixing mixed-integer inequalities
- Finite-time analysis of the multiarmed bandit problem
