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

作者：Bergantinos G; Gomez Rua M; Llorca N; Pulido M; Sanchez Soriano J^*

来源：Operations Research Letters, 2012, 40(1): 52-55.

DOI：10.1016/j.orl.2011.11.003

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

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.

• 出版日期2012-1