Back to results

Università degli Studi di Milano

OPTIMISATION AND INTERDICTION PROBLEMS FOR NETWORK SAFETY

Abstract

dc:description

In this thesis, we explore optimisation problems related to security, focusing on real-world systems that can be modelled using graphs or binary matrices. The first problem we examine is the Weighted Safe Set Problem, a graph optimisation problem that seeks to identify vertex partitions satisfying specific dominance constraints between the parts. For this problem, we propose an exact combinatorial branch-and-bound algorithm alongside several randomised heuristics. Next, we introduce a family of Binary Interdiction Problems, referred to as Hard Interdiction Problems, involving two agents: the attacker, who acts as the leader, and the defender, who acts as the follower. The defender solves an optimisation problem after the attacker has interdicted the original instance by blocking certain elements, aiming to degrade the defender’s optimal solution as much as possible. For this family of problems, we improve upon state-of-the-art algorithmic frameworks by proposing new formulations and techniques. Finally, we define the concept of a Resilient Sample: a set of feasible defender solutions such that the attacker cannot simultaneously interdict all of them. We also present methods to compute Resilient Samples for several families of interdiction problems.

Degree

thesis:*
Grantor dc:publisher
Università degli Studi di Milano
Year dc:date
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • BOGGIO TOMASAZ, ALBERTO
Contributors dc:contributor
  • supervisore: R. Cordone ; co-supervisore: G. Righini ; coordinator: R. Sassi
  • A. BOGGIO TOMASAZ
  • CORDONE, ROBERTO
  • SASSI, ROBERTO

Subjects

dc:subject × 15

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
eng

Identifiers

dc:identifier.*
OAI identifier oai:identifier
oai:air.unimi.it:2434/1119489

Chain of custody

source
Harvested from
Università degli Studi di Milano
Base URL
air.unimi.it/oai/request
Last updated
2026-07-27
Source record
OAI-PMH GetRecord
citation

BOGGIO TOMASAZ, ALBERTO. OPTIMISATION AND INTERDICTION PROBLEMS FOR NETWORK SAFETY. Università degli Studi di Milano, 2024. https://hdl.handle.net/2434/1119489