-
An Efficient Algorithm for the Knapsack Sharing Problem
Knapsack Sharing Problem (KSP) is an NP-Hard combinatorial optimization problem, admitted in numerous real world applications. In the KSP, we have a knapsack of... -
Contribution à la résolution de problèmes d'optimisation combinatoire : métho...
Combinatorial optimization problems are difficult problems whose solution by exact methods can be time consuming or not realistic. The use of heuristics permits one to... -
The Hybrid Methods in Combinatorial Optimization: Exact Algorithms and Heuris...
Cette thèse a été préparée au sein du CERMSEM (Centre de Recherches en Mathématiques, Statistiques et Economie Mathématique) UMR-CNRS 8095, et ausein de l'équipe Optimisation et... -
Dual approaches in stochastic programming
The global purpose of this thesis is to study the conditions to extend analytical and algebraical properties commonly observed in the resolution of deterministic... -
A Multi-Period Renewal equipment problem
International audience
