Pages that link to "Item:Q1011262"
From MaRDI portal
The following pages link to A branching scheme for finding cost-minimal round robin tournaments (Q1011262):
Displaying 8 items.
- Minimizing costs in round robin tournaments with place constraints (Q1025238) (← links)
- Scheduling partial round robin tournaments subject to home away pattern sets (Q1028835) (← links)
- A Lagrangian approach for minimum cost single round robin tournaments (Q1762030) (← links)
- On the separation in 2-period double round robin tournaments with minimum breaks (Q1762158) (← links)
- RobinX: a three-field classification and unified data format for round-robin sports timetabling (Q2273913) (← links)
- A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
- Strategic manipulations in round-robin tournaments (Q6163307) (← links)
- Optimal seedings in interdependent contests (Q6179218) (← links)
