The objective of the proposed research is to perform research in the following areas of combinatorial optimization : the design (and efficient emplementation) of polynomially bounded algorithms for certain practically relevant classes of problems, approximative and probabilistic algorithms, as well as good heuristics for difficult (NP-complete) problems and, last but not least, the development of an associated structure theory in particular of general principles on which efficient algorithms for combinatorial problems are based.