A cost allocation rule for k-hop minimum cost spanning tree problems

被引：8

作者：

Bergantinos, G. ^{[2
]}

Gomez-Rua, M. ^{[2
]}

Llorca, N. ^{[1
]}

Pulido, M. ^{[3
]}

Sanchez-Soriano, J. ^{[1
]}

机构：

[1] Univ Miguel Hernandez Elche, Ctr Operat Res CIO, Alicante, Spain

[2] Univ Vigo, Res Grp Econ Anal, Vigo, Spain

[3] Univ Murcia, Dept Stat & Operat Res, E-30001 Murcia, Spain

来源：

OPERATIONS RESEARCH LETTERS | 2012年 / 40卷 / 01期

关键词：

K-hop minimum cost spanning tree problems; Bankruptcy problems; Constrained equal awards rule; GAMES;

D O I：

10.1016/j.orl.2011.11.003

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this note, we prove that the core of a k-hop minimum cost spanning tree problem could be empty. We also introduce a cost sharing rule based on bankruptcy problems. We prove that this rule satisfies meaningful properties for these problems. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：52 / 55

页数：4

共 9 条

[1] Approximating k-hop minimum-spanning trees [J].