Pages that link to "Item:Q817277"
From MaRDI portal
The following pages link to The nucleolus of balanced simple flow networks (Q817277):
Displaying 16 items.
- Sharing costs in highways: a game theoretic approach (Q257250) (← links)
- On the lexicographic centre of multiple objective optimization (Q274101) (← links)
- Finding the nucleoli of large cooperative games (Q320842) (← links)
- Path cooperative games (Q724748) (← links)
- Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
- Finding and verifying the nucleolus of cooperative games (Q2235144) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- Relative nucleolus of flow game on a simple network (Q2919747) (← links)
- On the Core and <i>f</i>-Nucleolus of Flow Games (Q3169076) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
- Finding nucleolus of flow game (Q5896983) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)