On the core of the minimum cost Steiner tree game in networks
type: Item
instance of: scholarly article
title: On the core of the minimum cost Steiner tree game in networks
zbMATH Open document ID: 0837.90136
DOI: 10.1007/BF02099700
author: Darko Skorin-Kapov
published in: Annals of Operations Research
publication date: 1995-08-27T00:00:00Z
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 790519
zbMATH Keywords: Steiner tree
zbMATH Keywords: cost allocation
zbMATH Keywords: ST-game
zbMATH Keywords: core heuristic
MaRDI profile type: Publication
cites work: An integer linear programming approach to the steiner problem in graphs
cites work: An SST-based algorithm for the steiner problem in graphs
cites work: On cost allocation for a spanning tree: A game theoretic approach
cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut
cites work: Q4198056
cites work: A generalized linear production model: A unifying model
cites work: Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
cites work: Minimum cost spanning tree games
cites work: On the core and nucleolus of minimum cost spanning tree games
cites work: Geometric algorithms and combinatorial optimization
cites work: Q3048571
cites work: A simple expression for the nucleolus in a special case
cites work: Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
cites work: Cores of Games with Fixed Costs and Shared Facilities
cites work: On the core of network synthesis games
cites work: A dual ascent approach for steiner tree problems on a directed graph
full work available at URL: https://doi.org/10.1007/bf02099700
OpenAlex ID: W2045100727
description: scientific article; zbMATH DE number 790519