Showing 1 - 10 of 13
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...
Persistent link: https://www.econbiz.de/10011723705
A single round robin tournament (RRT) consists of a set T of n teams (n even) and a set P of n - 1 periods. The teams have to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period. In order to establish fairness among...
Persistent link: https://www.econbiz.de/10011723724
We study round-robin tournaments for 2n teams. Here n is either interpreted as the number of clubs, each having two teams, or the number of strength groups with two teams each. For even n we give a construction of a Single round-robin tournament for 2n teams with 2n - 2 breaks, where the teams...
Persistent link: https://www.econbiz.de/10011558719
In general scheduling a sports league is a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three index assignment problem. The complexity of scheduling a round robin tournaments is settled by a reduction...
Persistent link: https://www.econbiz.de/10011558814
Generally speaking in sports competition a number of teams play against each other over a period of time according to a certain scheme. The round robin scheme is very popular in many team sports like soccer and basketball. In this paper we study several basic variants of round robin tournaments....
Persistent link: https://www.econbiz.de/10011558821
The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or...
Persistent link: https://www.econbiz.de/10011558835
Persistent link: https://www.econbiz.de/10011325642
Persistent link: https://www.econbiz.de/10011325653
The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or...
Persistent link: https://www.econbiz.de/10011723112
Single round robin tournaments are a well known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated to each possible match. The goal is to find the minimum cost tournament among those having the minimum number of breaks. We pick up...
Persistent link: https://www.econbiz.de/10011723416