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

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

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

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at finding as fast as possible...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem (RCPSP) have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences, feasible completion times or feasible subsets, they all...

Numerous exact algorithms have been developed for solving the resource-constrained project scheduling problem. Experimental studies have shown that currently even projects with only 60 activities cannot be optimally solved within a reasonable amount of time. Therefore heuristics employing...

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

We consider an extension of the classical resource-constrained project scheduling problem (RCPSP), which covers discrete resource-resource and time-resource tradeoffs. As a result a project scheduler is permitted to identify several alternatives or modes of accomplishment for each activity of...