The researchb group focuses on problems of the form: determine a solution which, given a number of boundary conditions, minimizes the costs, or maximizes the proceeds. In combinatorial or integer optimization, some variables only can take numerical values of a number, which makes the optimization problem more difficult.
Combinatorial optimization goes into problems in operational management, such as the distribution and production planning, and more technical problems, which for example occur with the design and operating of computer systems.
Research topics: polyhedral techniques; local search; performance guarantees for approximation algorithms; structure of graphs, matroids and matrices; online routing; scheduling; matroid representation; network problems; computational biology.
Wil je meer informatie over de inhoud van het dossier of in contact worden gebracht met de kennisaanbieder? Neem dan contact met ons op.