Pages that link to "Item:Q2514781"

The following pages link to A new rule for source connection problems (Q2514781):

Displaying 11 items.

• Cost allocation in asymmetric trees (Q296616) (← links)
• A solution concept for network games: the role of multilateral interactions (Q319240) (← links)
• Horizontal cooperation in a multimodal public transport system: the profit allocation problem (Q1713763) (← links)
• Axiomatization of the counting rule for cost-sharing with possibly redundant items (Q2125113) (← links)
• Allocating costs in set covering problems (Q2178140) (← links)
• One-way and two-way cost allocation in hub network problems (Q2178916) (← links)
• Cost additive rules in minimum cost spanning tree problems with multiple sources (Q2241238) (← links)
• On how to allocate the fixed cost of transport systems (Q2241244) (← links)
• A characterization of the folk rule for multi-source minimal cost spanning tree problems (Q2294338) (← links)
• The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources (Q2334863) (← links)
• Algorithms for computing the folk rule in minimum cost spanning tree problems with groups (Q6110599) (← links)