EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Organisation

9712 Tight bounds for break minimization

Home Policy Brochure Browse Search User Area Contact Help

Brouwer, A.E. and Post, G.F. and Woeginger, G.J. (2007) Tight bounds for break minimization. Memorandum 1836, Department of Applied Mathematics, University of Twente, Enschede. ISSN 1874-4850

There is a more recent version of this eprint available. Click here to view it.

Full text available as:

PDF

190 Kb

Official URL: http://www.math.utwente.nl/publications

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 1/4 n(n−2) breaks. This construction establishes a matching lower bound for a corresponding upper bound from the literature.

Item Type:	Internal Report (Memorandum)
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:	9712
Deposited On:	07 May 2007
More Information:	statistics metis

Available Versions of this Item

Tight bounds for break minimization (deposited 07 May 2007)
[Currently Displayed]
- Tight bounds for break minimization in tournament scheduling (deposited 13 November 2008)

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item