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

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

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