Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction

DOI10.33048/daio.2020.27.687zbMath1493.90033OpenAlexW4246140388MaRDI QIDQ5090156

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/da954

zbMATH Keywords

cut generationdefender-attacker problemtotal deficit

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• An exact approach for the \(r\)-interdiction covering problem with fortification
• Deterministic network interdiction
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• A bilevel mixed-integer program for critical infrastructure protection planning
• A problem in network interdiction
• Fragile networks: identifying vulnerabilities and synergies in an uncertain age

This page was built for publication: Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction