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

DOI10.1002/net.22191OpenAlexW4387502207MaRDI QIDQ6196869

Bernard Fortz, Michał Pióro, Unnamed Author, 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

zbMATH Keywords

resilienceservice networksSDNcontrol nodescontrollers placementnode attacksoptimization and integer programming

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Total dual integrality and integer polyhedra
• Bilevel programming: a survey
• Compact models for critical node detection in telecommunication networks
• The critical node detection problem in networks: a survey
• 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
• 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