Optimisation robuste des réseaux de télécommunications

Abstract : This thesis deals with taking uncertain data into account in optimization problems. Our focus is on mathematical programs with chance constraints. In this approach, the goal is to find the best solution, given a unfeasibility probability tolerance. Furthermore, we concentrate on integer variables, since they are often required for practical applications.

To solve such chance-constrained combinatorial problems, we first rely on robust optimization. The theoretical links between these two families of approaches are studied. Based on appropriate robust models, solution algorithms to chance-constrained combinatorial problems are designed. Then, the optimal solution of such problems is also investigated. Specific theoretical results and algorithms are given to reach optimality. Finally, two specific telecommuniation applications are developed. Both of them deal with location in a network.
Document type :
Complete list of metadatas

Contributor : Olivier Klopfenstein <>
Submitted on : Tuesday, September 16, 2008 - 9:56:53 AM
Last modification on : Friday, May 17, 2019 - 11:41:06 AM
Long-term archiving on : Thursday, June 3, 2010 - 9:34:06 PM


  • HAL Id : tel-00321868, version 1


Olivier Klopfenstein. Optimisation robuste des réseaux de télécommunications. Modélisation et simulation. Université de Technologie de Compiègne, 2008. Français. ⟨tel-00321868⟩



Record views


Files downloads