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

Gustavo Bergantiños and Leticia Lorenzo ()
Additional contact information
Leticia Lorenzo: Universidade de Vigo

Annals of Operations Research, 2021, vol. 301, issue 1, No 2, 5-15

Abstract: 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 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.

Keywords: Minimum cost spanning tree problems; Multiple sources; Kruskal sharing rules; Axiomatic characterizations (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-020-03868-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
Working Paper: Cost additive rules in minimum cost spanning tree problems with multiple sources (2019)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:301:y:2021:i:1:d:10.1007_s10479-020-03868-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-020-03868-2

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().