On some properties of cost allocation rules in minimum cost spanning tree problems

1. G. Bergantiños
2. J.J. Vidal-Puga

Exportar

Exportar

×

MLA

modern-language-association

APA

apa

Chicago

chicago-fullnote-bibliography

Harvard

harvard-cite-them-right

Vancouver

vancouver-author-date

---

RIS BibTex

Exportar

×

Non se pode exportar o documento porque pertence a outro portal.

Texto completo

lock_openTexto completo externo

DIALNET GOOGLE SCHOLAR lock_openAcceso aberto editor

Resumo

We consider four cost allocation rules in minimum cost spanning tree problems. These rules were introduced by Bird (1976), Dutta and Kar (2004), Kar (2002), and Feltkamp, Tijs and Muto (1994), respectively. We give a list of desirable properties and we study which properties are satisfied by these rules.

Fonte de datos: Dialnet