Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147666
Authors: 
Briskorn, Dirk
Drexl, Andreas
Year of Publication: 
2006
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 609
Abstract: 
A single round robin tournament can be described as a league of a set T of n teams (n even) to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period resulting in a set P of n — 1 periods. Matches are carried out at one of both opponents' stadiums. A team playing twice at home or twice away in two consecutive periods is said to have a break in the latter of both periods. There is a vast field of requests arising in real world problems. For example, the number of breaks is to be minimized due to fairness reasons. It is well known that at least n — 2 breaks must occur. We focus on schedules having the minimum number of breaks. Costs corresponding to each possible match are given and the objective is to minimize the sum of arranged matches' cost. Then, sports league scheduling can be seen as a hard combinatorial optimization problem. We develop a branch & price approach in order to find optimal solutions.
Subjects: 
Sports league scheduling
round robin tournaments
break
branch& price
Document Type: 
Working Paper
Document Version: 
Digitized Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.