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):
Displaying 20 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)
- Tight bounds for break minimization in tournament scheduling (Q941319) (← links)
- Feasibility of home-away-pattern sets for round robin tournaments (Q943780) (← links)
- Constructing fair sports league schedules with regard to strength groups (Q968118) (← links)
- Combinatorial properties of strength groups in round robin tournaments (Q1011217) (← links)
- Minimization of rest mismatches in round robin tournaments (Q1654351) (← links)
- Constructing day-balanced round-robin tournaments with partitions (Q1682881) (← links)
- Scheduling double round-robin tournaments with divisional play using constraint programming (Q1751946) (← links)
- On the separation in 2-period double round robin tournaments with minimum breaks (Q1762158) (← 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)
- On the generalized mirrored scheme for double round robin tournaments in sports scheduling (Q2846487) (← links)
- On equitable round-robin tournaments with maximal break interval greater than or equal to 5 (Q2875382) (← links)
- (Q4393347) (← links)
- (Q5401127) (← links)
- The flexibility of home away pattern sets (Q6090216) (← links)
- Round-robin scheduling with regard to rest differences (Q6113552) (← links)
