The following pages link to Minimum cost arborescences (Q665084):
Displaying 11 items.
- Cost allocation in asymmetric trees (Q296616) (← links)
- Strategic sharing of a costly network (Q504401) (← links)
- Minimum incoming cost rules for arborescences (Q1697835) (← links)
- Investigation on irreducible cost vectors in minimum cost arborescence problems (Q1753571) (← links)
- Hyperadditive games and applications to networks or matching problems (Q1995312) (← links)
- One-way and two-way cost allocation in hub network problems (Q2178916) (← links)
- Routing-proofness in congestion-prone networks (Q2183993) (← links)
- Stability and fairness in the job scheduling problem (Q2273931) (← links)
- CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS (Q2854002) (← links)
- Stable and weakly additive cost sharing in shortest path problems (Q6146452) (← links)
- A non-cooperative approach to the folk rule in minimum cost spanning tree problems (Q6164740) (← links)
