A single round robin tournament (SRRT) consists of n teams and a set of periods. Matches between the teams have to be scheduled such that each team plays against each other team exactly once and each team plays at most once per period. In order to establish fairness among teams we consider a...

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. Moreover, stadium availability, fixed matches, and regions' capacities are taken into account. The goal is...

Several types of constraints must be satisfied by schedules of real world sports leagues, e. g. stadium unavailability, fixed matches, forbidden matches, minimum number of breaks. Taking into account such constraints, determining a feasible schedule becomes a challenging task. Usually, there is...

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. Since matches are carried out at one of both opponents venues matches may be forbidden in certain periods...

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...

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...

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....

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...