Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 616
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.
Round robin tournaments Home-Away-Pattern set feasibility problem