We investigate a facility location problem incorporating service competition and disruption risks.
We develop a new binary bilevel linear programming (BBLP) model.
We design a variable neighborhood decomposition search matheuristic embedded with variable fixing and cut generation.
Exhaustive experiments prove the efficiency of our methods and draw interesting managerial insights.
Proposed methods can be extended to general BBLPs, preserving all fathoming and branching rules.