In project management, the project duration can often be compressed by accelerating some of its activities at an additional expense. This is the so-called time-cost tradeoff problem which has been extensively studied in the past. However, the discrete version of the problem which is of great...

Generating a regular season schedule is a demanding task for any sports league. In Europe, the creation of a suitable schedule for every national top soccer league not only has to address numerous conflicting inner-league requirements and preferences. Additionally, the games of the European Cup...

This paper addresses the airport flight gate assignment problem with multiple objectives. The objectives are to maximize the total flight gate preferences, to minimize the number of towing activities and to minimize the absolute deviation of the new gate assignment from a so-called reference...

The multiple-choice nested knapsack problem (MCKP) is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The binary choice of selecting an item is replaced by taking exactly one item out of each class of items. Due to the fact that the MCKP is...

The generalized assignment problem (GAP) examines the maximum profit assignment of jobs to processors such that each job is assigned to precisely one processor subject to capacity restrictions on the processors. Due to the fact that the GAP is an NP-hard integer program dual prices are not...