Minimizing expected attacking cost in networks

MaRDI QIDQ2861515zbMATH OpenFDO

Authors Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbeche

Publication date 8 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065310001216

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Optimal attack and reinforcement of a network
• Optimal serverless networks attacks, complexity and some approximate algorithms
• Optimal attack strategy of complex networks based on tabu search
• Network disconnection problems in a centralized network
• Underestimated cost of targeted attacks on complex networks

Cites work

• Game theoretic risk analysis of security threats
• Optimal resource allocation for security in reliability systems

Cited in

(7)

• Optimal attack strategy of complex networks based on tabu search
• Underestimated cost of targeted attacks on complex networks
• Systems under attack-survivability rather than reliability: concept, results, and applications
• A metaheuristic for security budget allocation in utility networks
• Optimal serverless networks attacks, complexity and some approximate algorithms
• Network disconnection problems in a centralized network
• Min–max optimization of node‐targeted attacks in service networks

This page was built for publication: Minimizing expected attacking cost in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861515)