Pages that link to "Item:Q1779696"

The following pages link to A polynomial-time algorithm to find an equitable home--away assignment (Q1779696):

Displaying 18 items.

• Breaks, cuts, and patterns (Q408430) (← links)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• On the application of graph colouring techniques in round-robin sports scheduling (Q709125) (← links)
• A Benders approach for the constrained minimum break problem (Q856212) (← links)
• Balanced home-away assignments (Q865752) (← links)
• Combinatorial properties of strength groups in round robin tournaments (Q1011217) (← links)
• On the separation in 2-period double round robin tournaments with minimum breaks (Q1762158) (← 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)
• Round robin scheduling -- a survey (Q2475809) (← links)
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem (Q2500541) (← links)
• Sports tournaments, home-away assignments, and the break minimization problem (Q2506823) (← links)
• Semidefinite programming based approaches to the break minimization problem (Q2583777) (← links)
• ON THE GENERALIZED MIRRORED SCHEME FOR DOUBLE ROUND ROBIN TOURNAMENTS IN SPORTS SCHEDULING (Q2846487) (← links)
• Sports scheduling: Problems and applications (Q4918255) (← links)
• A tutorial on graph models for scheduling round‐robin sports tournaments (Q6056890) (← links)
• A quest for a fair schedule: the international Young Physicists' Tournament (Q6102843) (← links)