Master Class in Hybrid Methods for Combinatorial/Mixed Optimization

Master Class in Hybrid Methods

for Combinatorial/Mixed Optimization

CIMI event, Toulouse, France

4 - 5 June 2018


The « Hybrid Methods for Combinatorial/Mixed Optimization » Master Class will take place at LAAS-CNRS (LAAS) and is part of the thematic semester « Optimization » organized by Labex CIMI.

This Master Class focuses on hybrid solution methods for Combinatorial Optimization Problems and Mixed Discrete/Continuous Optimization Problems. These problems, of high practical and theoretical relevance, are the subject of intensive research in several communities within Operations Research and Artificial Intelligence. Because they are very challenging problems, combining different approaches has often been the key in significant computational breakthrough. Many successful problem-specific methods   or general-purpose solvers rely in hybridizing several components among Mixed-Integer Linear and Non-Linear programming, Constraint Programming, Dynamic Programming, Boolean Satisfiability, Local Search… This exceptional Master Class funded by the Labex CIMI gathers international experts that will share their experience in several classes hybrid methods.


Registration to attend the conference is now open. Please note that the registration is free but mandatory.

Please note that limited funding is available for accommodation. Selected applicants will be notified by Wednesday 2nd of May at the latest (a short CV of the student must be provided).

Register now

Date of the Master Class

4 - 5 June 2018

Confirmed speakers

Pierre Bonami (Laboratoire d'Informatique Fondamentale de Marseille at Aix Marseille University)

Mixed-Integer Linear and Nonlinear Programming Methods

Pierre Bonami is Researcher at LIF/Aix Marseille Université, currently on leave at IBM and developer of CPLEX. He is  interested in the development of algorithmic techniques for finding optimal solutions of integer programs and proving their optimality. His 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 his research he tries  to study both theoretical and computational aspects by conducting extended computational experiments. He also tries to make available the codes he develops to conduct computational experiments. He is the project manager of the Bonmin solver and of the CglLandP cut generator. He is a permanent member of the COIN-OR foundation.

Willem Jan van Hoeve (Carnegie Mellon University)

Decision diagrams for Discrete Optimization, Constraint programming, and Integer Programming

Willem van Hoeve is Associate Professor of Operations Researchat Tepper School of Business, Carnegie Mellon University. He is interested in operations research, optimization, constraint programming, integer programming, hybrid solution methods, decision diagrams for optimization, and their application to vehicle routing, scheduling, network design, home care operations. Recently he developed new methodologies based on decision diagrams, that are are compact graphical representations of Boolean functions, to tackle discrete optimization problems.

John Hooker (Carnegie Mellon University)

Hybrid Mixed-Integer Programming / Constraint Programming Methods

John Hooker is Professor of Operations Research and Holleran Professor of Business Ethics and Social Responsibility at Tepper School of Business, Carnegie Mellon University.  He is a pioneer in the integration of optimization and constraint programming technologies, having written the first book and co-chaired the first conference on the subject. OR/CP integration is now an active research field and is the basis for leading software packages like IBM's OPL Studio and the popular award-winning solver SCIP. He also introduced logic-based Benders decomposition, which can reduce solution times by orders of magnitude and has found a wide variety of applications. More recently, he and T. Hadžić adapted decision diagrams to optimization, and several investigators are now pursuing this line of research.

Paul Shaw (IBM Research)

Combinations of local search and constraint programming

Paul Shaw is Development Manager of CP Optimizer at STSM, Optimization Technology, IBM.  At IBM, he heads up constraint programming development, a technology for solving  of complex highly combinatorial problems, in CP Optimizer, the CP solver of CPLEX Optimization Studio. My product focus is on product innovation, speed, quality and robustness. He has over twenty years of experience in combinatorial optimization. His technical interests vary over many aspects of science and technology. His specialties include Constraint Programming, Combinatorial Optimization, Local Search and Meta-Heuristics, Vehicle Routing, Packing.

Laurent Simon (Computer Science Lab of Bordeaux -Labri- at University of Bordeaux)

Understanding, using and extending SAT solvers

Laurent Simon is Professor in the Formal Methods group of the Computer Science Lab of Bordeaux (Labri). He teaches at the Bordeaux Polytechnic National Institute (INP) in the computer Science department. He is also associate member of the LRI laboratory in the University of Orsay Paris 11, in the Artificial Intelligence and Inference System group (IASI) . His main research interests are on propositional-based reasoning, SAT solving and efficient Prime Implicates generation / Knowledge Base Compilation. He is also working on decentralized approaches of some of hese topics (reasoning on top of P2P and social networks) and how to push computer science to a real experimental science (especially search algorithms). He is also trying to apply those decentralized reasoning systems to diagnosis of (intrinsic) distributed systems.


Under construction.


Organizing commitee

Christian Artigues (LAAS-CNRS), Olga Battaïa (ISAE), Sonia Cafieri (ENAC), Helène Fargier (IRIT), Georges Katsirelos (INRA), Cédric Pralet (ONERA), Aude Rondepierre (IMT).

Scientific commitee

  • ENAC : Nicolas Barnier, Sonia Cafieri, Catherine Mancel, Marcel Mongeau, Mohand Sbihi.
  • IMT : Aude Rondepierre.
  • INRA : Georges Katsirelos, Simon de Givry, Thomas Schiex.
  • IRIT : Hélène Fargier, Martin Cooper.
  • ISAE : Olga Battaïa, Alain Haït, Emmanuel Rachelson.
  • LAAS : Christian Artigues, Denis Arzelier, Cyril Briand, Emmanuel Hébrard, Laurent Houssin, Marie-José Huguet, Pierre Lopez, Julien Moncel, Sandra U. Ngueveu.
  • ONERA : Cédric Pralet, Xavier Olive, Stéphanie Roussel.



For any questions, please contact Christian Artigues and Aude Rondepierre : send an email