It is often too time-consuming to compute an exact optimal solution of an NP-hard problem (non-deterministic polynomial). One way out is to be satisfied with approximate solutions. During the 1990s tremendous progress was made in the area of approximation algorithms. The goal of this project is to apply, to extend and to generalize the newly developed techniques. The main focus is on a variety of combinatorial optimization problems where special emphasis is put on sequencing, scheduling, packing and covering problems. Sequencing and scheduling problems involve the allocation of activities to resources of limited capacity and availability over time. In packing and covering problems, the goal is to pack a set of small items into a set of large items or to cover a set of large items by a set of small items.
|Effective start/end date||1/03/97 → 30/06/02|