Pages that link to "Item:Q1011217"

The following pages link to Combinatorial properties of strength groups in round robin tournaments (Q1011217):

Displaying 14 items.

• Round-robin tournaments with homogeneous rounds (Q475180) (← links)
• Constructing fair round robin tournaments with a minimum number of breaks (Q614051) (← links)
• IP models for round robin tournaments (Q955618) (← links)
• Constructing fair sports league schedules with regard to strength groups (Q968118) (← links)
• A combinatorial property of the maximum round robin tournament problem (Q969517) (← links)
• Minimization of rest mismatches in round robin tournaments (Q1654351) (← links)
• Constructing day-balanced round-robin tournaments with partitions (Q1682881) (← links)
• A Lagrangian approach for minimum cost single round robin tournaments (Q1762030) (← links)
• Scheduling asynchronous round-robin tournaments (Q1785478) (← links)
• RobinX: a three-field classification and unified data format for round-robin sports timetabling (Q2273913) (← links)
• Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks (Q2450701) (← links)
• (Q5401127) (← links)
• (Q5401245) (← links)
• Round-robin scheduling with regard to rest differences (Q6113552) (← links)