Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem

DOI10.1287/moor.17.4.765zbMath0783.90128OpenAlexW2124174877MaRDI QIDQ4027794

Daniel Granot, Frieda Granot

Publication date: 1 March 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.17.4.765

zbMATH Keywords

corefacility locationnucleolusundirected connected graphfixed cost spanning forest gamefixed cost spanning forest problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Cooperative games (91A12) Other game-theoretic models (91A40) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (15)

Common mistakes in computing the nucleolus ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ On the core of the minimum cost Steiner tree game in networks ⋮ The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources ⋮ On the complexity of testing membership in the core of min-cost spanning tree games ⋮ Minimum cost forest games ⋮ The kernel/nucleolus of a standard tree game ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES ⋮ On the core and nucleolus of directed acyclic graph games ⋮ Axiomatization of the Shapley value on minimum cost spanning tree games ⋮ Dominating set games. ⋮ Cost monotonicity, consistency and minimum cost spanning tree games ⋮ Network strength games: the core and the nucleolus ⋮ On a cost allocation problem arising from a capacitated concentrator covering problem

This page was built for publication: Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem