Research Interests

I am interested in the development of algorithmic techniques for finding optimal solutions of integer programs and proving their optimality. My research lies mainly in two areas:

  • cuts for mixed integer linear programs (lift-and-project, MIG cuts, Chvatal cuts), and
  • exact algorithms for mixed integer nonlinear programming.

In my research I try to study both theoretical and computational aspects by conducting extended computational experiments. I also try try to make available the codes I develop to conduct computational experiments.

I am the project manager of the Bonmin solver and of the CglLandP cut generator.

I am a permanent member of the COIN-OR foundation.

Previous Appointments

2006-2007: Long term supplemental in IBM T.J. Watson Math Department

2004-2006: Post-doctoral fellow at Tepper School of Business, Carnegie Mellon University.

2003-2004 : Research Staff ARMINES, Paris.

2000-2003 : Ph.D. fellowship (Alloctaire de recherches)


2003: Ph.D. in Operations research and computer science of Université Paris 6

Supervised Students

Ph.D. thesis of Hassan Hijazi (December 2007 – November 2010), Co-advisor with Gérard Cornuéjols (CMU) and Adam Ouorou (Orange Labs).


MIP 2009 (USC Berkley, Berkley, June 2009).

EWMINLP10 (CIRM, Marseille, April 2010)


Doctoral course : Inégalités valides en programmation en nombres entiers (5h30), JPOC’05.

Master course Modelization in OR, 2nd Year of Master, 2008, 2009 and 2010.

Master Course Combinatorial Optimization and Integer Programming, 2nd year of Master, 2009, 2010 and 2011.

Doctoral course "Cutting plane methods for integer and combinatorial optimization" ICSO 2010, Hammamet Tunisia.

Service Activities

Project Manager for Bonmin and CglLandP.

Permanent member of COIN-OR foundation .