Cost additive rules in minimum cost spanning tree problems with multiple sources

被引：4
|
作者：
Bergantinos, Gustavo [1 ]
Lorenzo, Leticia [1 ]
机构：
[1] Univ Vigo, Econ Soc & Terr, Vigo 36310, Spain
来源：
ANNALS OF OPERATIONS RESEARCH | 2021年 / 301卷 / 1-2期
关键词：
Minimum cost spanning tree problems; Multiple sources; Kruskal sharing rules; Axiomatic characterizations; FOLK RULE; ALLOCATION; MONOTONICITY;
D O I：
10.1007/s10479-020-03868-2
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple sources called Kruskal sharing rules. This family is characterized by cone-wise additivity and independence of irrelevant trees. We also investigate some subsets of this family and provide axiomatic characterizations of them. The first subset is obtained by adding core selection. The second is obtained by adding core selection and equal treatment of source costs.
引用
收藏
页码：5 / 15
页数：11
相关论文
共 50 条
12345