Computational comparisons of different formulations for the Bilevel Minimum Spanning Tree Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Transactions in Operational Research Year : 2021

Computational comparisons of different formulations for the Bilevel Minimum Spanning Tree Problem

Abstract

Let be given a graph G = (V, E) whose edge set is partitioned into a set R of red edges and a set B of blue edges, and assume that red edges are weighted and contain a spanning tree of G. Then, the Bilevel Minimum Spanning Tree Problem (BMSTP) is that of pricing (i.e., weighting) the blue edges in such a way that the total weight of the blue edges selected in a minimum spanning tree of the resulting graph is maximized. In this paper we present different mathematical formulations for the BMSTP based on the properties of the Minimum Spanning Tree Problem and the bilevel optimization. We establish a theoretical and empirical comparison between these new formulations and we also provide reinforcements that together with a proper formulation are able to solve medium to big size instances random instances. We also test our models in instances already existing in the literature.
Fichier principal
Vignette du fichier
BMST_paper_181126_nohead.pdf (452.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01937013 , version 1 (27-11-2018)

Identifiers

Cite

Martine Labbé, Miguel Pozo, Justo Puerto. Computational comparisons of different formulations for the Bilevel Minimum Spanning Tree Problem. International Transactions in Operational Research, 2021, ⟨10.1111/itor.12680⟩. ⟨hal-01937013⟩
111 View
286 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More