Speaker

Gerard Cornuejols
IBM University Professor of Operations Research
Tepper School of Business
Carnegie Mellon University

Abstract

This talk will be based on joint work with Borozan, Basu, Conforti and Zambelli. We extend a theorem of Lovasz characterizing maximal lattice-free convex sets. This result has implications in integer programming. In particular we show a ono-to-one correspondance between these sets and minimal inequalities.

Bio

Gerard Cornuejols was Editor-in-Chief of MOR during the period of 1999-2003 and has been serving in the Advisory Board of MOR since then. He is very famous for his works on Integer Programming, for which he has been awarded several important prizes, namely:

• Dantzig Prize, Mathematical Programming Society (MPS) and Society for Industrial and Applied Mathematics (SIAM) - 2009
• SIAM Outstanding Paper Prize - 2004
• Fulkerson Prize, AMS and MPS - 2000
• von Humbolt Fellow - 1982
• Lanchester Prize, INFORMS - 1977