Min-max optimization of node‐targeted attacks in service networks - Publication - Bridge of Knowledge

Search

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

Abstract

This article considers resilience of service networks that are composed of service and control nodes to node-targeted attacks. Two complementary problems of selecting attacked nodes and placing control nodes reflect the interaction between the network operator and the network attacker. This interaction can be analyzed within the framework of game theory. Considering the limited performance of the previously introduced iterative solution algorithms based on non-compact problem models, new compact integer programming formulations of the node attack optimization problem are proposed, which are based on the notion of pseudo-components and on a bilevel model. The efficiency of the new formulations is illustrated by the numerical study that uses two reference networks (medium-size and large-size), and a wide range of the sizes of attacks and controllers placements.

Citations

  • 0

    CrossRef

  • 0

    Web of Science

  • 0

    Scopus

Authors (4)

Cite as

Full text

full text is not available in portal

Keywords

Details

Category:
Articles
Type:
artykuły w czasopismach
Published in:
NETWORKS no. 83, pages 256 - 288,
ISSN: 0028-3045
Language:
English
Publication year:
2024
Bibliographic description:
Fortz B., Mycek M., Pióro M., Tomaszewski A.: Min-max optimization of node‐targeted attacks in service networks// NETWORKS -,iss. 2 (2024), s.256-288
DOI:
Digital Object Identifier (open in new tab) 10.1002/net.22191
Sources of funding:
  • Free publication
Verified by:
Gdańsk University of Technology

seen 0 times

Recommended for you

Meta Tags