The mixed integer linear bilevel programming problem
Operations Research
New branch-and-bound rules for linear bilevel programming
SIAM Journal on Scientific and Statistical Computing
Bilevel programming applied to the flow shop scheduling problem
Computers and Operations Research
Discrete linear bilevel programming problem
Journal of Optimization Theory and Applications
On solving unreliable planar location problems
Computers and Operations Research
Stochastic Network Interdiction
Operations Research
Reliability Models for Facility Location: The Expected Failure Cost Case
Transportation Science
Deterministic network interdiction
Mathematical and Computer Modelling: An International Journal
Decision support for network disruption mitigation
Decision Support Systems
Computers and Operations Research
The Effect of Supply Disruptions on Supply Chain Design Decisions
Transportation Science
Management of disruption risk in global supply chains
IBM Journal of Research and Development
The Nested Event Tree Model with Application to Combating Terrorism
INFORMS Journal on Computing
Optimal Allocation of Protective Resources in Shortest-Path Networks
Transportation Science
Optimal Allocation of Protective Resources in Shortest-Path Networks
Transportation Science
The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
INFORMS Journal on Computing
A bilevel fixed charge location model for facilities under imminent attack
Computers and Operations Research
Vulnerability based robust protection strategy selection in service networks
Computers and Industrial Engineering
The r-interdiction median problem with probabilistic protection and its solution algorithm
Computers and Operations Research
Reliable facility location design under disruptions
Computers and Operations Research
A Bilevel p-median model for the planning and protection of critical facilities
Journal of Heuristics
Computers and Industrial Engineering
Computers and Operations Research
Characterizing multi-event disaster resilience
Computers and Operations Research
Protection issues for supply systems involving random attacks
Computers and Operations Research
Hi-index | 0.01 |
Vulnerability to sudden service disruptions due to deliberate sabotage and terrorist attacks is one of the major threats of today. In this paper, we present a bilevel formulation of the r-interdiction median problem with fortification (RIMF). RIMF identifies the most cost-effective way of allocating protective resources among the facilities of an existing but vulnerable system so that the impact of the most disruptive attack to r unprotected facilities is minimized. The model is based upon the classical p-median location model and assumes that the efficiency of the system is measured in terms of accessibility or service provision costs. In the bilevel formulation, the top level problem involves the decisions about which facilities to fortify in order to minimize the worst-case efficiency reduction due to the loss of unprotected facilities. Worst-case scenario losses are modeled in the lower-level interdiction problem. We solve the bilevel problem through an implicit enumeration (IE) algorithm, which relies on the efficient solution of the lower-level interdiction problem. Extensive computational results are reported, including comparisons with earlier results obtained by a single-level approach to the problem.