The design, analysis and implementation of optimization and approximation algorithms for combinatorial problems arising, in particular, from combinatorial optimization, game theory, molecular biology, mobile networks, production and transportation planning, scheduling, time-tabling. The methods come from mathematics (graph theory, discrete mathematics, topology, algebra, geometry), operations research (integer, linear, semidefinite and constraint programming), and computer science (complexity theory).
Meer weten?
Wil je meer informatie over de inhoud van het dossier of in contact worden gebracht met de kennisaanbieder? Neem dan contact met ons op.