A. Ridha Majhoub
Department of Statistics and Operations Research, Kuwait University, Kuwait
LAMSADE, Université Paris-Dauphine, Paris, France
ridha.mahjoub@ku.edu.kw , ridha.mahjoub@lamsade.dauphine.fr
https://www.lamsade.dauphine.fr/~mahjoub/

Network Design and Cutting Plane Algorithms: For the past few decades, combinatorial optimization techniques have shown to be powerful tools for formulating, analysing and solving problems arising from practical decision situations. In particular, cutting plane techniques have been successfully applied to many well- known NP-hard problems. The equivalence between separation and optimization over a polyhedron, and the evolution of computational tools have been behind the big development of these methods. The so-called Branch-and-Cut method, which is inspired from this equivalence, is now widely used for obtaining optimal and near-optimal solutions for hard and large sized combinatorial optimization problems. In this talk, we present these methods and discuss some applications to network design problems.