Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
详细信息 查看全文
- 作者：Bernard Fortza ; bernard.fortz@ulb.ac.be" class="auth_mail" title="E-mail the corresponding author ; Olga Oliveirab ; olga.oliveira@ua.pt" class="auth_mail" title="E-mail the corresponding author ; Cristina Requejo ; b ; crequejo@ua.pt" class="auth_mail" title="E-mail the corresponding author
- 关键词：Mixed integer linear programming ; Tree realization ; Topology discovery ; Routing topology inference ; Minimum evolution problem
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：1 January 2017
- 年：2017
- 卷：256
- 期：1
- 页码：242-251
- 全文大小：724 K
文摘
- •
Proposal of 2 compact MILP models to the Minimum Weighted Tree Reconstruction Problem.
- •
Models use flows to define the tree topology and have different objective functions.
- •
Computational results use instances from phylogenetic and telecommunications area.
- •
Computational results use sets of instances having up to 15 terminal nodes.
- •
One of the models outperforms the previous models proposed in the literature.