Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/17238
Title: | Compact mixed integer linear programming models to the Minimum Weighted Tree Reconstruction problem |
Author: | Fortz, Bernard Requejo, Cristina Oliveira, Olga |
Keywords: | Mixed integer linear programming Distance matrix Tree realization Topology discovery Routing topology inference Balanced minimum evolution problem Minimum evolution problem |
Issue Date: | Jan-2017 |
Publisher: | Elsevier |
Abstract: | The Minimum Weighted Tree Reconstruction (MWTR) problem consists of finding a minimum 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. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/17238 |
DOI: | 10.1016/j.ejor.2016.06.014 |
ISSN: | 0377-2217 |
Appears in Collections: | CIDMA - Artigos OGTCG - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
tree_discovery_authors_pprint.pdf | documento | 510.8 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.