What is Combinatorial Optimisation ?
Solve problems from Discrete Mathematics and design efficient algorithms
Updated on March 13, 2015
A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail
Combinatorial Optimization consists in finding a "best" choice among a finite (but usually very large) set of possibilities. We find and use structural properties of the problems we consider ("good" caracterizations, decompositions, ...) in order to design efficient algorithms (exact or approximate) or to show that such algorithms do not exist.
A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail
Date of update March 13, 2015