A bilevel mixed-integer program for critical infrastructure protection planning

DOI10.1016/j.cor.2006.09.019zbMath1139.90439MaRDI QIDQ2462537

Richard L. Church, Maria Paola Scaparra

Publication date: 30 November 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.09.019

zbMATH Keywords

bilevel programming; median location problems; protection models

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90B80: Discrete location and assignment

90C99: Mathematical programming

Related Items

Bilevel “Defender–Attacker” Model with Multiple Attack Scenarios, Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs, Robust Defibrillator Deployment Under Cardiac Arrest Location Uncertainty via Row-and-Column Generation, The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem, Multilevel Approaches for the Critical Node Problem, Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method, A Unified Framework for Multistage Mixed Integer Linear Optimization, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions, A Branch-and-Cut Algorithm for Submodular Interdiction Games, Designing a model for service facility protection with a time horizon based on tri-level programming, A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions, Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification, A bilevel “Attacker–Defender” model to choosing the composition of attack means, Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction, Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching, An exact approach for the r-interdiction median problem with fortification, On engineering game theory with its application in power systems, A generic optimization framework for resilient systems, Algorithms for a risk-averse Stackelberg game with multiple adversaries, A survey on mixed-integer programming techniques in bilevel optimization, An exact method for binary fortification games, A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems, Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing, Solving discretely-constrained Nash-Cournot games with an application to power markets, A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings, Capacitated \(p\)-center problem with failure foresight, Optimizing dynamic investment decisions for railway systems protection, A two-stage resource allocation model for lifeline systems quick response with vulnerability analysis, Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption, A trilevel programming approach for electric grid defense planning, A bilevel partial interdiction problem with capacitated facilities and demand outsourcing, Characterizing multi-event disaster resilience, Protection issues for supply systems involving random attacks, Efficient automated schematic map drawing using multiobjective mixed integer programming, The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm, Applying ranking and selection procedures to long-term mitigation for improved network restoration, A bi-level programming model for protection of hierarchical facilities under imminent attacks, Optimizing system resilience: a facility protection model with recovery time, Closest assignment constraints in discrete location problems, Designing robust coverage networks to hedge against worst-case facility losses, A novel algorithm for area traffic capacity control with elastic travel demands, The budget constrained \(r\)-interdiction median problem with capacity expansion, Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification, The multi-terminal maximum-flow network-interdiction problem, Hub interdiction problem variants: models and metaheuristic solution algorithms, Multilevel decision-making: a survey, Cyber-physical correlation effects in defense games for large discrete infrastructures, Exact method for the capacitated competitive facility location problem, A mixed-integer programming approach for locating jamming devices in a flow-jamming attack, Models of the optimal resource allocation for the critical infrastructure protection, Recovery strategies from major supply disruptions in single and multiple sourcing networks, An exact approach for the \(r\)-interdiction covering problem with fortification, Solving the traveling salesman problem with interdiction and fortification, An adaptive robust framework for the optimization of the resilience of interdependent infrastructures under natural hazards, Wireless LAN transmitter location under the threat of jamming attacks, Optimizing fortification plan of capacitated facilities with maximum distance limits, New models for the location of controversial facilities: a bilevel programming approach, Radio communications interdiction problem under deterministic and probabilistic jamming, A mixed-integer bilevel programming approach for a competitive prioritized set covering problem, An analytical approach to the protection planning of a rail intermodal terminal network, An implicit enumeration algorithm for the hub interdiction median problem with fortification, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, Incorporating the threat of terrorist attacks in the design of public service facility networks, A bilevel fixed charge location model for facilities under imminent attack, The stochastic interdiction median problem with disruption intensity levels, Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure, Network resilience, A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption, Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks, Stackelberg production-protection games: defending crop production against intentional attacks, An exact algorithm for solving the bilevel facility interdiction and fortification problem, A decomposition approach for stochastic shortest-path network interdiction with goal threshold, Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach, Terrorism deterrence in a two country framework: strategic interactions between R\&D, defense and pre-emption, An exact solution approach for the interdiction median problem with fortification, Bilevel multi-objective construction site security planning with twofold random phenomenon, A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff, A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints, A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection, An iterative security game for computing robust and adaptive network flows, Reliable distribution networks design with nonlinear fortification function, A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries, On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions, Fuzzy interdiction/fortification location problems on p-median systems, A Brief Overview of Interdiction and Robust Optimization, A facility reliability problem: Formulation, properties, and algorithm, A defensive maximal covering problem on a network

Cites Work