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

317 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

Keywords

  • Networks
  • Cost Allocation
  • costs and cost price

Fingerprint Dive into the research topics of 'On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems'. Together they form a unique fingerprint.

Cite this