Pages that link to "Item:Q4740362"
From MaRDI portal
The following pages link to Activity selection games and the minimum‐cut problem (Q4740362):
Displaying 7 items.
- Activity optimization games with complementarity (Q1091957) (← links)
- Communication and its cost in graph-restricted games (Q1107455) (← links)
- Cooperative games arising from network flow problems (Q1178645) (← links)
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
- Paths on polymatroids (Q1196722) (← links)
- Monotonicity of the core and value in dynamic cooperative games (Q2641231) (← links)
- Adjacency on polymatroids (Q3335528) (← links)
