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

Dirk Briskorn

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 : Inst. f. Betriebswirtschaftslehre
Subject:	Round robin tournaments \| Home-Away-Pattern set feasibility problem \| Sport \| Sports \| Scheduling-Verfahren \| Scheduling problem \| Theorie \| Theory

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

Elektronische Reproduktion von:

Feasibility of Home-Away-Pattern sets. - Kiel : Inst. f. Betriebswirtschaftslehre, 2007. - 4 Bl.

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