Models for the Interdiction Problem for the Minimum Spanning - 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

Models for the Interdiction Problem for the Minimum Spanning

Résumé

The Minimum Spanning Tree Interdiction (MSTI) problem is a two-player game between a network operator aiming to determine a Minimum Spanning Tree (MST) and an interdictor which, constrained by a budget, changes the network topology to increase the weight of a MST. Mathematical formulations for a generalization of the MSTI problem are devised, and valid inequalities are proposed. Dominance relations between the models are studied, and computational experiments are presented to evaluate their efficiencies.
Fichier non déposé

Dates et versions

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

Licence

Paternité

Identifiants

  • HAL Id : hal-04398295 , version 1

Citer

Luis Salazar-Zendeja, Diego Cattaruzza, Martine Labbé, Frédéric Semet. Models for the Interdiction Problem for the Minimum Spanning. 10th International Congress on Industrial and Applied Mathematics, International Council for Industrial and Applied Mathematics, Aug 2023, Tokyo (JP), Japan. ⟨hal-04398295⟩
6 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More