Compact Mixed Integer Linear Programming models to the Minimum Weighted Tree Reconstruction Problem - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue European Journal of Operational Research Année : 2017

Compact Mixed Integer Linear Programming models to the Minimum Weighted Tree Reconstruction Problem

Résumé

The Minimum Weighted Tree Reconstruction (MWTR) problem consists of finding a min imum length weighted tree connecting a set of terminal nodes in such a way that the length of the path between each pair of terminal nodes is greater than or equal to a given distance between the considered pair of terminal nodes. This problem has applications in several areas, namely, the inference of phylogenetic trees, the modeling of traffic networks and the analysis of internet infrastructures. In this paper, we investigate the MWTR problem and we present two compact mixed-integer linear programming models to solve the problem. Computational results using two different sets of instances, one from the phylogenetic area and another from the telecommunications area, show that the best of the two models is able to solve instances of the problem having up to 15 terminal nodes.
Fichier principal
Vignette du fichier
tree_discovery_authors_pprint.pdf (510.8 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01410554 , version 1 (04-09-2024)

Licence

Identifiants

Citer

Bernard Fortz, Olga Oliveira, Cristina Requejo. Compact Mixed Integer Linear Programming models to the Minimum Weighted Tree Reconstruction Problem. European Journal of Operational Research, 2017, 256 (1), pp.242 - 251. ⟨10.1016/j.ejor.2016.06.014⟩. ⟨hal-01410554⟩
119 Consultations
2 Téléchargements

Altmetric

Partager

More