Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/147669
Authors: 
Briskorn, Dirk
Year of Publication: 
2007
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 616
Abstract: 
When scheduling a round robin tournament (RRT) a Home-Away-Pattern (HAP) set defines for each team i and each period p whether i plays at home or away in p. So far the complexity of the decision problem whether a RRT can be arranged based on a given HAP set or not is open. We give a necessary condition which can be checked in polynomial time. We conjecture this condition to be sufficient and confirm this by a computational study.
Subjects: 
Round robin tournaments
Home-Away-Pattern set feasibility problem
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.