Bilevel “Defender–Attacker” Model with Multiple Attack Scenarios

DOI10.1134/S1990478918030031zbMath1413.90110OpenAlexW2888334040MaRDI QIDQ4558293

Andrey Melnikov, I. A. Davydov, P. A. Kononova, Vladimir Beresnev

Publication date: 21 November 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478918030031

zbMATH Keywords

bilevel programmingoptimality criteriacomplementarity slackness

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Cooperative games (91A12) Management decision making, including multiple objectives (90B50)

Related Items

Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
• The budget constrained \(r\)-interdiction median problem with capacity expansion
• Foundations of bilevel programming
• A bilevel fixed charge location model for facilities under imminent attack
• One-level reformulation of the bilevel Knapsack problem using dynamic programming
• Local search for load balancing problems for servers with large dimension
• A bilevel mixed-integer program for critical infrastructure protection planning
• A study on the use of heuristics to solve a bilevel programming problem
• Facility Location in Unfair Competition
• Game-Theoretic Patrolling with Dynamic Execution Uncertainty and a Case Study on a Real Transit System