Designing robust coverage networks to hedge against worst-case facility losses
From MaRDI portal
Publication:617512
DOI10.1016/j.ejor.2010.08.030zbMath1208.90105OpenAlexW2036894450MaRDI QIDQ617512
Jesse R. O'Hanley, Richard L. Church
Publication date: 21 January 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.08.030
Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (23)
Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ A reliable budget-constrained FL/ND problem with unreliable facilities ⋮ The reliable \(p\)-median problem with at-facility service ⋮ Capacitated \(p\)-center problem with failure foresight ⋮ Optimizing dynamic investment decisions for railway systems protection ⋮ A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions ⋮ Integer programming formulations for three sequential discrete competitive location problems with foresight ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ Optimizing system resilience: a facility protection model with recovery time ⋮ An exact approach for the \(r\)-interdiction covering problem with fortification ⋮ Solving the traveling salesman problem with interdiction and fortification ⋮ Radio communications interdiction problem under deterministic and probabilistic jamming ⋮ Optimal sensor deployment to increase the security of the maximal breach path in border surveillance ⋮ 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 ⋮ Equilibrium strategies for multiple interdictors on a common network ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ 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 ⋮ An exact algorithm for solving the bilevel facility interdiction and fortification problem ⋮ An exact approach for the r-interdiction median problem with fortification ⋮ Probability chains: a general linearization technique for modeling reliability in facility location and related problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- Computing approximate solutions of the maximum covering problem with GRASP
- Practical bilevel optimization. Algorithms and applications
- Deterministic network interdiction
- A bilevel mixed-integer program for critical infrastructure protection planning
- Production planning problem with sequence dependent setups as a bilevel programming problem
- Single- and multi-objective defensive location problems on a network
- An exact solution approach for the interdiction median problem with fortification
- On the Stackelberg strategy in nonzero-sum games
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
- Stochastic Network Interdiction
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- A facility reliability problem: Formulation, properties, and algorithm
- A defensive maximal covering problem on a network
- Nature Reserve Site Selection to Maximize Expected Species Covered
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- The Maximum Availability Location Problem
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- The Mixed Integer Linear Bilevel Programming Problem
- Removing Arcs from a Network
This page was built for publication: Designing robust coverage networks to hedge against worst-case facility losses
