A bilevel programming model for proactive countermeasure selection in complex ICT systems

DOI10.1016/j.endm.2018.02.004zbMath1392.90028OpenAlexW2794077812MaRDI QIDQ1742246

Nancy Perrot, M. Yassine Naghmouchi, Ali Ridha Mahjoub

Publication date: 11 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.02.004

zbMATH Keywords

branch-and-cutbilevel programmingcountermeasure selectionrisk assessment graphs

Mathematics Subject Classification ID

Uses Software

• CPLEX

Cites Work

• On short paths interdiction problems: Total and node-wise limited interdiction
• Foundations of bilevel programming
• Finding the most vital arcs in a network
• A problem in network interdiction
• Shortest-path network interdiction
• Unnamed Item

This page was built for publication: A bilevel programming model for proactive countermeasure selection in complex ICT systems