A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
From MaRDI portal
Publication:336824
DOI10.1016/j.cor.2012.08.013zbMath1348.91080OpenAlexW2026383541MaRDI QIDQ336824
Necati Aras, Sema Şengül Akca, Deniz Aksen
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.08.013
Hierarchical games (including Stackelberg games) (91A65) Deterministic network models in operations research (90B10)
Related Items
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 ⋮ Optimizing dynamic investment decisions for railway systems protection ⋮ A mixed-integer programming approach for locating jamming devices in a flow-jamming attack ⋮ A bi-level programming model for protection of hierarchical facilities under imminent attacks ⋮ 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 ⋮ Fuzzy interdiction/fortification location problems on p-median systems ⋮ Wireless LAN transmitter location under the threat of jamming attacks ⋮ Optimizing fortification plan of capacitated facilities with maximum distance limits ⋮ A bi-level model and memetic algorithm for arc interdiction location-routing problem ⋮ Optimal sensor deployment to increase the security of the maximal breach path in border surveillance ⋮ An implicit enumeration algorithm for the hub interdiction median problem with fortification ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ On the solution of convex bilevel optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimizing system resilience: a facility protection model with recovery time
- 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
- Parametric integer programming algorithm for bilevel mixed integer programs
- Deterministic network interdiction
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Survivable network design under optimal and heuristic interdiction scenarios
- A bilevel mixed-integer program for critical infrastructure protection planning
- Global optimization of mixed-integer bilevel programming problems
- A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
- Integer Programming with a Fixed Number of Variables
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- Nelder-Mead Simplex Modifications for Simulation Optimization
- Shortest-path network interdiction
- The Mixed Integer Linear Bilevel Programming Problem
- Removing Arcs from a Network
- Optimal interdiction policy for a flow network
- Optimal interdiction of a supply network
- A Simplex Method for Function Minimization
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
