Universität zu Köln

Briskorn, Dirk ORCID: 0000-0003-1829-8100, Drexl, Andreas and Spieksma, Frits C. R. (2010). Round robin tournaments and three index assignments. 4OR-Q. J. Oper. Res., 8 (4). S. 365 - 375. HEIDELBERG: SPRINGER HEIDELBERG. ISSN 1614-2411

Full text not available from this repository.

Abstract

Scheduling a sports league can be seen as 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 minimum cost round robin tournament is established by a reduction from the planar three-index assignment problem. Furthermore, we introduce integer programming models. We pick up a popular idea and decompose the overall problem in order to obtain two subproblems which can be solved sequentially. We show that the latter subproblem can be casted as a planar three-index assignment problem. This makes existing solution techniques for the planar three-index assignment problem amenable to sports league scheduling.

Item Type:	Journal Article
Creators:	Creators Email ORCID ORCID Put Code Briskorn, Dirk UNSPECIFIED orcid.org/0000-0003-1829-8100 UNSPECIFIED Drexl, Andreas UNSPECIFIED UNSPECIFIED UNSPECIFIED Spieksma, Frits C. R. UNSPECIFIED UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-491000
DOI:	10.1007/s10288-010-0123-y
Journal or Publication Title:	4OR-Q. J. Oper. Res.
Volume:	8
Number:	4
Page Range:	S. 365 - 375
Date:	2010
Publisher:	SPRINGER HEIDELBERG
Place of Publication:	HEIDELBERG
ISSN:	1614-2411
Language:	English
Faculty:	Unspecified
Divisions:	Unspecified
Subjects:	no entry
Uncontrolled Keywords:	Keywords Language INTEGER; GRAPH; LEAGUE Multiple languages Operations Research & Management Science Multiple languages
URI:	http://kups.ub.uni-koeln.de/id/eprint/49100