Min–max optimization of node‐targeted attacks in service networks

DOI10.1002/NET.22191OpenAlexW4387502207MaRDI QIDQ6196869FDOQ6196869

Authors: Bernard Fortz, Michał Pióro, Artur Tomaszewski 

Publication date: 15 March 2024

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22191

Recommendations

• Optimal serverless networks attacks, complexity and some approximate algorithms
• Attack and interception in networks
• Multilevel approaches for the critical node problem
• Minimizing expected attacking cost in networks
• Optimal response to epidemics and cyber attacks in networks

zbMATH Keywords

resilienceservice networksSDNcontrol nodescontrollers placementnode attacksoptimization and integer programming

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• On the asymmetric representatives formulation for the vertex coloring problem
• A branch-and-cut algorithm for the ring spur assignment problem
• The critical node detection problem in networks: a survey
• Bilevel programming: a survey
• Total dual integrality and integer polyhedra
• Compact models for critical node detection in telecommunication networks
• A survey on mixed-integer programming techniques in bilevel optimization

This page was built for publication: Min–max optimization of node‐targeted attacks in service networks

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