Munich Personal RePEc Archive

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

Bergantiños, Gustavo and Lorenzo, Leticia (2019): Cost additive rules in minimum cost spanning tree problems with multiple sources.

[img]
Preview
PDF
MPRA_paper_96937.pdf

Download (258kB) | Preview

Abstract

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 with cone wise additivity and independence of irrelevant trees . We also investigate some subsets of this family and provide their axiomatic characterizations. The first subset is obtained by adding core selection. The second one is obtained by adding core selection and equal treatment of source costs

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.