The budget constrained \(r\)-interdiction median problem with capacity expansion
From MaRDI portal
Publication:623776
DOI10.1007/s10100-009-0110-6zbMath1204.90058OpenAlexW2076484073MaRDI QIDQ623776
Necati Aras, Nuray Piyade, Deniz Aksen
Publication date: 8 February 2011
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-009-0110-6
binary enumeration treefacility protectioninterdiction median problem with fortificationmixed-integer bilevel programming
Related Items (27)
Interdicting facilities in tree networks ⋮ 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 bilevel partial interdiction problem with capacitated facilities and demand outsourcing ⋮ Protection issues for supply systems involving random attacks ⋮ The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm ⋮ Bilevel “Defender–Attacker” Model with Multiple Attack Scenarios ⋮ A bi-level programming model for protection of hierarchical facilities under imminent attacks ⋮ Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification ⋮ A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection ⋮ A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption ⋮ The r‐interdiction selective multi‐depot vehicle routing problem ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ Optimizing system resilience: a facility protection model with recovery time ⋮ Optimizing fortification plan of capacitated facilities with maximum distance limits ⋮ On the multicriteria allocation problem ⋮ Radio communications interdiction problem under deterministic and probabilistic jamming ⋮ Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks ⋮ 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 ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ On the hardness of covering-interdiction problems ⋮ An exact algorithm for solving the bilevel facility interdiction and fortification problem ⋮ An exact approach for the r-interdiction median problem with fortification
Uses Software
Cites Work
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- COBRA: A new formulation of the classic \(p\)-median location problem
- Foundations of bilevel programming
- Algorithms for solving the mixed integer two-level linear programming problem
- Location of preventive health care facilities
- A hierarchical location model for public facility planning
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact solution approach for the interdiction median problem with fortification
- An overview of bilevel optimization
- Closest assignment constraints and location models: Properties and structure
- The Mixed Integer Linear Bilevel Programming Problem
This page was built for publication: The budget constrained \(r\)-interdiction median problem with capacity expansion
