A branching scheme for finding cost-minimal round robin tournaments

详细信息    查看全文

• 作者：Dirk Briskorn ; Andreas Drexl
• 关键词：Timetabling ; Sports ; Sports league scheduling ; Round robin tournaments ; Home– ; away-pattern set ; Branch-and-bound
• 刊名：European Journal of Operational Research
• 出版年：2009
• 出版时间：16 August 2009
• 年：2009
• 卷：197
• 期：1
• 页码：68-76
• 全文大小：322 K

文摘

Single round robin tournaments are a well known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated to each possible match. The goal is to find the minimum cost tournament among those having the minimum number of breaks. We pick up structural properties of home–away-pattern sets having the minimum number of breaks. A branching idea using these properties is developed in order to guide branching steps on the first levels of a branch-and-bound tree in order to avoid nodes corresponding to infeasible subproblems.