Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147661
Authors: 
Briskorn, Dirk
Drexl, Andreas
Spieksma, Frits C. R.
Year of Publication: 
2005
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 604
Abstract: 
In general scheduling a sports league is a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three index assignment problem. The complexity of scheduling a round robin tournaments is settled by a reduction from the planar three index assignment problem. Furthermore, integer programming models are introduced. We pick up a popular idea and decompose the overall problem in order to obtain two subproblems which can be solved sequentially. The latter subproblem can be represented as a planar three index assignment problem which makes corresponding Solution techniques amenable to sports league scheduling.
Subjects: 
Sports league scheduling
round robin tournaments
first-break-then-schedule
three index assignment
Document Type: 
Working Paper

Files in This Item:
File
Size





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