Feasibility of Home-Away-Pattern sets: A necessary condition

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.

MoreLess

Year of publication:	2007
Authors:	Briskorn, Dirk
Publisher:	Kiel : Universität Kiel, Institut für Betriebswirtschaftslehre
Subject:	Sport \| Scheduling-Verfahren \| Theorie \| Round robin tournaments \| Home-Away-Pattern set feasibility problem

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Series:	Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; 616
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	898553911 [GVK] hdl:10419/147669 [Handle] RePEc:zbw:cauman:616 [RePEc]
Source:	EconStor

Persistent link: https://www.econbiz.de/10011558822