This project continues the successful cooperation between the group in Graz and the two groups in Szeged. The project has two main goals. One is to perform joint research in combinatorial optimization and the other is to exchange experiences in teaching the field of combinatorial optimization to graduate and to doctoral students. Research-wise the focus is on the development of exact and heuristic algorithms for scheduling problems, bin packing problems and other types of packing and covering problems, data compression, process network synthesis, assignment problems and global optimization. Special emphasis is given to the analysis of the worst-case behaviour respectively the competitive ratio of various off-line and on-line algorithms for scheduling problems and for packing problems.
|Effective start/end date||1/01/95 → 30/04/97|
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.