Pages that link to "Item:Q614051"
From MaRDI portal
The following pages link to Constructing fair round robin tournaments with a minimum number of breaks (Q614051):
Displayed 3 items.
- Inequity averse optimization in operational research (Q319581) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks (Q2450701) (← links)