On the core of the minimum cost Steiner tree game in networks
From MaRDI portal
Publication:1897387
DOI10.1007/BF02099700zbMath0837.90136OpenAlexW2045100727MaRDI QIDQ1897387
Publication date: 27 August 1995
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02099700
Programming involving graphs or networks (90C35) Integer programming (90C10) Cooperative games (91A12) Linear programming (90C05)
Related Items (5)
Social enterprise tree network games ⋮ Minimal Subsidies in Expense Sharing Games ⋮ A note on Steiner tree games ⋮ On the set of extreme core allocations for minimal cost spanning tree problems ⋮ Strategic cooperation in cost sharing games
Cites Work
- Unnamed Item
- Unnamed Item
- On the core of network synthesis games
- Geometric algorithms and combinatorial optimization
- A simple expression for the nucleolus in a special case
- A dual ascent approach for steiner tree problems on a directed graph
- On the core and nucleolus of minimum cost spanning tree games
- Cores of Games with Fixed Costs and Shared Facilities
- A generalized linear production model: A unifying model
- An SST-based algorithm for the steiner problem in graphs
- An integer linear programming approach to the steiner problem in graphs
- Minimum cost spanning tree games
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- On cost allocation for a spanning tree: A game theoretic approach
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
This page was built for publication: On the core of the minimum cost Steiner tree game in networks
