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 10 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)
- Minimization of rest mismatches in round robin tournaments (Q1654351) (← links)
- Scheduling double round-robin tournaments with divisional play using constraint programming (Q1751946) (← links)
- Scheduling asynchronous round-robin tournaments (Q1785478) (← links)
- Integrated break and carryover effect minimization (Q2093191) (← links)
- Determining matchdays in sports league schedules to minimize rest differences (Q2183190) (← links)
- Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks (Q2450701) (← links)
- The flexibility of home away pattern sets (Q6090216) (← links)
- Round-robin scheduling with regard to rest differences (Q6113552) (← links)