Pages that link to "Item:Q943780"
From MaRDI portal
The following pages link to Feasibility of home-away-pattern sets for round robin tournaments (Q943780):
Displaying 13 items.
- Edge coloring: a natural model for sports scheduling (Q323273) (← links)
- Breaks, cuts, and patterns (Q408430) (← links)
- A combinatorial property of the maximum round robin tournament problem (Q969517) (← links)
- A branching scheme for finding cost-minimal round robin tournaments (Q1011262) (← links)
- On the separation in 2-period double round robin tournaments with minimum breaks (Q1762158) (← links)
- The multi-league sports scheduling problem, or how to schedule thousands of matches (Q1984695) (← links)
- On the complexity of pattern feasibility problems in time-relaxed sports timetabling (Q2661499) (← links)
- ON THE GENERALIZED MIRRORED SCHEME FOR DOUBLE ROUND ROBIN TOURNAMENTS IN SPORTS SCHEDULING (Q2846487) (← links)
- A tutorial on graph models for scheduling round‐robin sports tournaments (Q6056890) (← links)
- The flexibility of home away pattern sets (Q6090216) (← links)
- First-break-heuristically-schedule: constructing highly-constrained sports timetables (Q6106547) (← links)
- Multi-league sports scheduling with different leagues sizes (Q6106988) (← links)
- A traditional Benders' approach to sports timetabling (Q6109825) (← links)