返回
Looking for edge-equitable spanning trees
DOI:10.1016/j.cor.2013.07.023.png)
摘要
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.
Keyword:
Integer programming
Spanning tree
Ordered median function
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Induction and elimination of bulky benzo[a]pyrene-related DNA adducts and 8-oxodGuo in mussels Mytilus galloprovincialis exposed in vivo to B[a]P-contaminated feed体内暴露于B[a]P污染的饲料中的贻贝Mytilus galloprovincialis中庞大的苯并 [a] re相关DNA加合物和8-氧代果的诱导和消除
Labeling of the Internal Pool of GP IIb-IIIa in Platelets by c7E3 Fab Fragments (abciximab): Flow and Endocytic Mechanisms Contribute to the Transport
Blood
IF0
Cannabis-Microbiome Interactions in Varied Clinical Contexts: A Comprehensive Systematic Review不同临床情境下的annabis-Microbiome相互作用:一项全面的系统综述

