EEMCS
Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


14159 Tight bounds for break minimization in tournament scheduling
 Home Policy Brochure Browse Search User Area Contact Help

Brouwer, A.E. and Post, G.F. and Woeginger, G.J. (2008) Tight bounds for break minimization in tournament scheduling. Journal of Combinatorial Theory, Series A, 115 (6). pp. 1065-1068. ISSN 0097-3165 *** ISI Impact 0,783 ***

This is the latest version of this eprint.

Full text available as:

PDF
 - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
90 Kb

Official URL: http://dx.doi.org/10.1016/j.jcta.2007.10.002

Exported to Metis

Abstract

We consider round-robin sports tournaments with $n$ teams and $n-1$ rounds. We construct an infinite family of opponent schedules for which every home-away assignment induces at least $n(n-2)/4$ breaks. This construction establishes a matching lower bound for a corresponding upper bound from the literature.

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:Latin squares, sports scheduling, sports tournament, break minimization
ID Code:14159
Status:Published
Deposited On:13 November 2008
Refereed:Yes
International:Yes
ISI Impact Factor:0,783
More Information:statisticsmetis

Available Versions of this Item

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