Pages that link to "Item:Q2500541"

The following pages link to Maximizing breaks and bounding solutions to the mirrored traveling tournament problem (Q2500541):

Displaying 16 items.

• Edge coloring: a natural model for sports scheduling (Q323273) (← links)
• A 2.75-approximation algorithm for the unconstrained traveling tournament problem (Q475199) (← links)
• Round robin tournaments and three index assignments (Q633482) (← links)
• Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America (Q828758) (← links)
• A Benders approach for the constrained minimum break problem (Q856212) (← links)
• Solving mirrored traveling tournament problem benchmark instances with eight teams (Q924643) (← links)
• A Benders approach for computing lower bounds for the mirrored traveling tournament problem (Q1015323) (← links)
• Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem (Q1719646) (← links)
• RobinX: a three-field classification and unified data format for round-robin sports timetabling (Q2273913) (← links)
• Handling fairness issues in time-relaxed tournaments with availability constraints (Q2289924) (← links)
• Round robin scheduling -- a survey (Q2475809) (← links)
• A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem (Q2684046) (← links)
• Sports scheduling: Problems and applications (Q4918255) (← links)
• A tutorial on graph models for scheduling round‐robin sports tournaments (Q6056890) (← links)
• Confection de calendriers de matchs pour le sport universitaire et collégial au Québec (Q6102699) (← links)
• A traditional Benders' approach to sports timetabling (Q6109825) (← links)