On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems

V. Feltkamp, S.H. Tijs, S. Muto

Research output: Working paperDiscussion paperOther research output

273 Downloads (Pure)

Abstract

Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces an algorithm generating all elements of the irreducible core. Moreover, the equal remaining obligations rule, a one-point refinement of the irreducible core ispresented. Finally, the paper characterizes these solutions axiomatically. The classical Bird tree allocation of minimum cost spanning tree problems is obtained as a particular case in our algorithm for the irreducible core.
Original languageEnglish
PublisherUnknown Publisher
Number of pages36
Volume1994-106
Publication statusPublished - 1994

Publication series

NameCentER Discussion Paper
Volume1994-106

Fingerprint

Costs
Birds

Keywords

  • Networks
  • Cost Allocation
  • costs and cost price

Cite this

Feltkamp, V., Tijs, S. H., & Muto, S. (1994). On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. (CentER Discussion Paper; Vol. 1994-106). Unknown Publisher.
Feltkamp, V. ; Tijs, S.H. ; Muto, S. / On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. Unknown Publisher, 1994. (CentER Discussion Paper).
@techreport{56ea8c64a05f4b3fab619096e213f109,
title = "On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems",
abstract = "Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces an algorithm generating all elements of the irreducible core. Moreover, the equal remaining obligations rule, a one-point refinement of the irreducible core ispresented. Finally, the paper characterizes these solutions axiomatically. The classical Bird tree allocation of minimum cost spanning tree problems is obtained as a particular case in our algorithm for the irreducible core.",
keywords = "Networks, Cost Allocation, costs and cost price",
author = "V. Feltkamp and S.H. Tijs and S. Muto",
note = "Pagination: 36",
year = "1994",
language = "English",
volume = "1994-106",
series = "CentER Discussion Paper",
publisher = "Unknown Publisher",
type = "WorkingPaper",
institution = "Unknown Publisher",

}

Feltkamp, V, Tijs, SH & Muto, S 1994 'On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems' CentER Discussion Paper, vol. 1994-106, Unknown Publisher.

On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. / Feltkamp, V.; Tijs, S.H.; Muto, S.

Unknown Publisher, 1994. (CentER Discussion Paper; Vol. 1994-106).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems

AU - Feltkamp, V.

AU - Tijs, S.H.

AU - Muto, S.

N1 - Pagination: 36

PY - 1994

Y1 - 1994

N2 - Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces an algorithm generating all elements of the irreducible core. Moreover, the equal remaining obligations rule, a one-point refinement of the irreducible core ispresented. Finally, the paper characterizes these solutions axiomatically. The classical Bird tree allocation of minimum cost spanning tree problems is obtained as a particular case in our algorithm for the irreducible core.

AB - Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces an algorithm generating all elements of the irreducible core. Moreover, the equal remaining obligations rule, a one-point refinement of the irreducible core ispresented. Finally, the paper characterizes these solutions axiomatically. The classical Bird tree allocation of minimum cost spanning tree problems is obtained as a particular case in our algorithm for the irreducible core.

KW - Networks

KW - Cost Allocation

KW - costs and cost price

M3 - Discussion paper

VL - 1994-106

T3 - CentER Discussion Paper

BT - On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems

PB - Unknown Publisher

ER -

Feltkamp V, Tijs SH, Muto S. On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. Unknown Publisher. 1994. (CentER Discussion Paper).