A bilevel “Attacker–Defender” model to choosing the composition of attack means

DOI10.33048/DAIO.2019.26.663zbMath1492.91073OpenAlexW4241617175MaRDI QIDQ5090136

Andrey Melnikov, Vladimir Beresnev

Publication date: 15 July 2022

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da935

zbMATH Keywords

optimality conditionbilevel subproblempartition of feasible region

Mathematics Subject Classification ID

Mixed integer programming (90C11) Hierarchical games (including Stackelberg games) (91A65) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Benders decomposition without separability: a computational study for capacitated facility location problems
• A trilevel programming approach for electric grid defense planning
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
• Foundations of bilevel programming
• A bilevel mixed-integer program for critical infrastructure protection planning
• The Mixed Integer Linear Bilevel Programming Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A bilevel “Attacker–Defender” model to choosing the composition of attack means