The Interdiction Problem for the Minimum Spanning Tree - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

The Interdiction Problem for the Minimum Spanning Tree

Résumé

In this presentation, we consider the Minimum Spanning Tree Interdiction (MSTI) problem. This problem is a two-player game between a network operator and an interdictor. The former aims to determine a Minimum Spanning Tree (MST) in a network. Constrained by a budget, the latter seeks to change the network topology to increase the weight of a MST. Two types of interdiction are considered: total and partial interdiction. A total interdicted edge is considered absent, while the weight of a partial interdicted edge is augmented by a predefined amount. The interdictor's budget is modeled as a cardinality, each edge has the same interdiction cost, or as a knapsack constraint, the interdiction costs might be different. Four mathematical formulations for a generalization of the MSTI problem are devised. In addition, valid inequalities are proposed to strengthen one of the models. Furthermore, an analysis of the dominance relations between the models is carried out. Finally, computational experiments are presented to evaluate the efficiency of our formulations.
Fichier non déposé

Dates et versions

hal-04398019 , version 1 (16-01-2024)

Licence

Paternité

Identifiants

  • HAL Id : hal-04398019 , version 1

Citer

Luis Salazar-Zendeja, Diego Cattaruzza, Martine Labbé, Frédéric Semet. The Interdiction Problem for the Minimum Spanning Tree. Optimization Workshop in Logistics - OWL 2023, University of Lecce, Jun 2023, Lecce (ITALY), Italy. ⟨hal-04398019⟩
8 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More