On the core of the minimum cost Steiner tree game in networks

DOI10.1007/BF02099700MaRDI QIDQ1897387zbMATH OpenOpenAlexFDO

Authors Darko Skorin-Kapov

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

zbMATH Keywords

core heuristiccost allocationST-gameSteiner tree

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Programming involving graphs or networks (90C35) Cooperative games (91A12)

Recommendations

• A note on Steiner tree games
• On the core and nucleolus of minimum cost spanning tree games
• The irreducible Core of a minimum cost spanning tree game
• On the core of cost-revenue games: minimum cost spanning tree games with revenues
• SUFFICIENT CONDITIONS FOR NONEMPTY CORE OF MINIMUM COST FOREST GAMES

Cites work

• A dual ascent approach for steiner tree problems on a directed graph
• A generalized linear production model: A unifying model
• A simple expression for the nucleolus in a special case
• An integer linear programming approach to the steiner problem in graphs
• An SST-based algorithm for the steiner problem in graphs
• Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Cores of Games with Fixed Costs and Shared Facilities
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach
• On the core and nucleolus of minimum cost spanning tree games
• On the core of network synthesis games
• Solving the Steiner Tree Problem on a Graph Using Branch and Cut

Cited in

(20)

• On a cost allocation problem arising from a capacitated concentrator covering problem
• Sharing the cost of a network: core and core allocations
• Social enterprise tree network games
• The minimum cost shortest-path tree game
• Total balancedness condition for Steiner tree games.
• Cost allocation in spanning network enterprises with stochastic connection costs.
• Strategic cooperation in cost sharing games
• Trouble comes in threes: core stability in minimum cost connection networks
• On the set of extreme core allocations for minimal cost spanning tree problems
• A note on Steiner tree games
• The irreducible Core of a minimum cost spanning tree game
• Minimal subsidies in expense sharing games
• On the core and nucleolus of minimum cost spanning tree games
• Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
• SUFFICIENT CONDITIONS FOR NONEMPTY CORE OF MINIMUM COST FOREST GAMES
• ON THE CORE OF THE NETWORK DESIGN GAME
• Trade-offs on the location of the core node in a network
• Cost Allocation for a Tree Network with Heterogeneous Customers
• Stable source connection and assignment problems as multi-period shortest path problems
• On the core of network synthesis games

This page was built for publication: On the core of the minimum cost Steiner tree game in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897387)