.png){kind=icon}
Return
Looking for edge-equitable spanning trees
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2013.07.023.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies the Ordered Spanning Tree Problem, where the weights of the edges of the tree are sorted and then linearly combined using a previously given coefficients vector. Depending on the coefficients, several objectives can be incorporated to the problem. We pay special attention to the search of spanning trees with balanced weights, i.e., where the differences among the weights are, in some sense, minimized. To solve the problem, we propose two Integer Programming formulations, one based on flow and the other one on the Miller-Tucker-Zemlin constraints. We analyze several potential improvements for both the formulations whose behaviors are checked by means of a computational experiment. Finally, we show how both the formulations can be adapted to incorporate to the objective non-linear functions of the weights. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Integer programming
Spanning tree
Ordered median function
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
ShareSaveShareSaveLabeling of the Internal Pool of GP IIb-IIIa in Platelets by c7E3 Fab Fragments (abciximab): Flow and Endocytic Mechanisms Contribute to the Transport.png)
Blood
BloodIF0
PREAI
ShareSaveCannabis-Microbiome Interactions in Varied Clinical Contexts: A Comprehensive Systematic Review
OAAI
IF0
OAAIShareSaveShareSaveShareSave
View more