Pages that link to "Item:Q899945"
From MaRDI portal
The following pages link to The minimum cost spanning forest game (Q899945):
Displaying 15 items.
- Generalized minimum spanning tree games (Q286691) (← links)
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- Communication and its cost in graph-restricted games (Q1107455) (← links)
- Cooperative games arising from network flow problems (Q1178645) (← links)
- Minimum cost forest games (Q1365003) (← links)
- Three-person spanning tree games (Q1596863) (← links)
- Multi-criteria minimum cost spanning tree games (Q1876137) (← links)
- Cost additive rules in minimum cost spanning tree problems with multiple sources (Q2241238) (← links)
- Trouble comes in threes: core stability in minimum cost connection networks (Q2242222) (← links)
- The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources (Q2334863) (← links)
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem (Q4027794) (← links)
- Proof of permutationally convexity of MCSF games (Q4296297) (← links)
- SUFFICIENT CONDITIONS FOR NONEMPTY CORE OF MINIMUM COST FOREST GAMES (Q4407200) (← links)
- The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources (Q5072241) (← links)