Universität zu Köln

Briskorn, D. (2011). A branching scheme for minimum cost tournaments with regard to real-world constraints. J. Oper. Res. Soc., 62 (12). S. 2133 - 2146. ABINGDON: TAYLOR & FRANCIS LTD. ISSN 1476-9360

Full text not available from this repository.

Abstract

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 with each possible match. Moreover, stadium availability, fixed matches, and regions' capacities are taken into account. The goal is to find the minimum cost tournament among those having the minimum number of breaks and being feasible with regard to these additional constraints. A branching scheme is developed where branching is done by fixing a break for a team. Thus, the focus is on identifying breaks leading to an infeasible home away pattern set in order to avoid the resulting infeasible subtrees of a branch and bound tree. Journal of the Operational Research Society (2011) 62, 2133-2145. doi: 10.1057/jors.2010.185 Published online 2 March 2011

Item Type:	Journal Article
Creators:	Creators Email ORCID ORCID Put Code Briskorn, D. UNSPECIFIED UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-484543
DOI:	10.1057/jors.2010.185
Journal or Publication Title:	J. Oper. Res. Soc.
Volume:	62
Number:	12
Page Range:	S. 2133 - 2146
Date:	2011
Publisher:	TAYLOR & FRANCIS LTD
Place of Publication:	ABINGDON
ISSN:	1476-9360
Language:	English
Faculty:	Unspecified
Divisions:	Unspecified
Subjects:	no entry
Uncontrolled Keywords:	Keywords Language SPORTS SCHEDULES; PATTERN SETS; LEAGUE; CONSTRUCTION; GRAPHS; MODELS Multiple languages Management; Operations Research & Management Science Multiple languages
URI:	http://kups.ub.uni-koeln.de/id/eprint/48454