EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Organisation

18970 Constructing fair round robin tournaments with a minimum number of breaks

Home Policy Brochure Browse Search User Area Contact Help

van 't Hof, P. and Post, G.F. and Briskorn, D. (2010) Constructing fair round robin tournaments with a minimum number of breaks. Operations research letters, 38 (6). pp. 592-596. ISSN 0167-6377 *** ISI Impact 0,537 ***

This is the latest version of this eprint.

Full text available as:

PDF

- Univ. of Twente only
228 Kb

Official URL: http://dx.doi.org/10.1016/j.orl.2010.08.008

Abstract

Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the number of breaks is 2n−2, teams of the same club never play at home simultaneously, and they play against each other in the first round. We also consider a fairness constraint related to different playing strengths of teams competing in the tournament.

Item Type:	Article
Research Group:	EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:	CTIT-IE&ICT: Industrial Engineering and ICT
Research Project:	BRICKS/IS3: Decision Support Systems for Logistic Networks and Supply Chain Optimization
Uncontrolled Keywords:	Sports, Round-robin tournaments, Break, Strength group
ID Code:	18970
Status:	Published
Deposited On:	06 December 2010
Refereed:	Yes
International:	Yes
ISI Impact Factor:	0,537
More Information:	statistics metis

Available Versions of this Item

Round-robin tournaments with minimum number of breaks and two teams per club (deposited 19 November 2009)
- Constructing fair round robin tournaments with a minimum number of breaks (deposited 06 December 2010)
  [Currently Displayed]

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item