Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
type: Item
instance of: scholarly article
title: Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
zbMATH Open document ID: 1430.90510
author: MHR (Arman) Khouzani
author: Zhengliang Liu
author: Pasquale Malacaria
published in: European Journal of Operational Research
publication date: 2019-06-27T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7074063
zbMATH Keywords: computing science
zbMATH Keywords: multi-objective optimisation
zbMATH Keywords: cyber-security
zbMATH Keywords: probabilistic attack graph
describes a project that uses: RRE
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.04.035
OpenAlex ID: W2943011553
cites work: The multi-terminal maximum-flow network-interdiction problem
cites work: The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
cites work: Infrastructure security games
cites work: A survey of recent developments in multiobjective optimization
cites work: Multicriteria Optimization
cites work: Shortest-path network interdiction
cites work: DAG-based attack and defense modeling: don't miss the forest for the attack trees
cites work: The k most vital arcs in the shortest path problem
cites work: Methods for removing links in a network to minimize the spread of infections
cites work: Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
cites work: A computational approach to determine damage in infrastructure networks from outage reports
cites work: Interdiction problems on planar graphs
cites work: Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
cites work: Finding the n Most Vital Links in Flow Networks
cites work: A framework for secure IT operations in an uncertain and changing environment
cites work: Optimal selection of IT security safeguards from an existing knowledge base
cites work: Q3818127
cites work: On the Stackelberg strategy in nonzero-sum games
cites work: Q3528714
cites work: Two-Person Zero-Sum Games for Network Interdiction
cites work: Deterministic network interdiction
cites work: Matching interdiction
Wikidata QID: Q127974335
DOI: 10.1016/J.EJOR.2019.04.035
description: scientific article; zbMATH DE number 7074063