Pages that link to "Item:Q4027794"

The following pages link to Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem (Q4027794):

Displaying 15 items.

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