Gérard P. Cornuéjols

View Printable Version

IBM University Professor of Operations Research

Teaching and Research Interests:

• Operations research, integer programming, logistics, optimization methods in finance. Contributions were made in location and distribution, integer programming algorithms, graph theory, packing and covering problems.

Website and/or personal homepage:
http://integer.tepper.cmu.edu

Published Papers: 

• Feasibility Pump for Mixed Integer Nonlinear Programs
  Mathematical Programming 119, 2009; 331-352.
  (With: François Margot, Pierre Bonami, A. Lodi)
  
  
• On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
  Mathematical Programming 120, 2009; 429-456.
  (With: François Margot)
  
  
• Valid Inequalities for Mixed Integer Linear Programs
  Mathematical Programming B, 2008.
  
  
• On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
  Mathematical Programming 120, 2009; 419-456.
  (With: François Margot)
  
  
• Revival of the Gomory Cuts in the 1990's
  State-of-the-Art and Recent Advances in Integer Programming, 2005.
  
  
• Recognizing Berge Graphs
  Combinatorica 25, 2005; 143-186.
  (With: Maria Chudnovsky, Xinming Liu, Paul Seymour, Kristina Vuskovic)
  
  
• Early Estimates of the Size of Branch-and-Bound Trees
  INFORMS Journal on Computing, 2004.
  (With: Miroslav Karamanov, Yanjun Li)
  
  
• Bicolorings and Equitable Bicolorings of Matrices
  MPS/SIAM Series on Optimization, The Sharpest Cut: The Impact of Manfred Padberg and His Work, 2004; 33-37.
  (With: Michele Conforti, Giacomo Zambelli)
  
  
• Square-Free Perfect Graphs
  Journal of Combinatorial Theory B, 2004; 257-307.
  (With: Michele Conforti, Kristina Vuskovic)
  
  
• Decomposition of Odd-Hole-Free Graphs, by Double Star Cutsets and 2-Joins
  Discrete mathematics 141, 2004; 41-91.
  (With: Michele Conforti, Kristina Vuskovic)
  
  
• Reduce-and-Split Cuts: Improving the Performance of Mixed Integer Gomory Cuts
  Management Science, 2003.
  (With: K. A. Andersen, Yanjun Li)
  
  
• Balanced Matrices
  Discrete Mathematics, 2003.
  (With: Michele Conforti, Kristina Vuskovic)
  
  
• The Strong Perfect Graph Theorem
  Optima 70, 2003; 2-6.
  
  
• Graphs without Odd Holes, Parachutes or Proper Wheels: A Generalization of Meyniel Graphs and of Line Graphs of Bipartite Graphs
  Journal of Combinatorial Theory B, 2003; 331-347.
  (With: Michele Conforti)
  
  
• A Class of Berge Graphs Containing P6
  Journal of Combinatorial Theory B, 2003; 300-330.
  (With: Xinming Liu)
  
  
• K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
  INFORMS Journal on Computing 15, 2003; 385-396.
  (With: Yanjun Li, Dieter Vandenbussche)
  
  
• Decomposing Berge Graphs Containing No Proper Wheel, Long Prism or their Complements
  Combinatorica, 2002.
  (With: Michele Conforti, Giacomo Zambelli)
  
  
• A Note on Dijoins
  Discrete Mathematics 243, 2002; 213-216.
  (With: B. Guenin)
  
  
• Ideal Binary Clutters, Connectivity and a Conjecture of Seymour
  SIAM Journal on Discrete Mathematics 15, 2002; 329-352.
  (With: B. Guenin)
  
  
• Ideal Clutters
  Discrete Applied Mathematics 123, 2002; 303-338.
  (With: B. Guenin)
  
  
• Even-Hole-Free Graphs Part II: Recognition Algorithm
  Journal of Graph Theory 40, 2002; 238-266.
  (With: Michele Conforti, Ajai Kapoor, Kristina Vuskovic)
  
  
• Even-Hole-Free Graphs Part I: Decomposition Theorem
  Journal of Graph Theory 39, 2002; 6-49.
  (With: Michele Conforti, Ajai Kapoor, Kristina Vuskovic)
  
  
• Perfect Graphs, Partitionable Graphs and Cutsets
  Combinatorica 22, 2002; 19-33.
  (With: Michele Conforti, Grigor Gasparyan, Kristina Vuskovic)
  
  
• On the Rank of Mixed 0, 1 Polyhedra
  Mathematical Programming A, 2002; 391-397.
  (With: Yanjun Li)
  
  
• A Connection Between Cutting Plane Theory and the Geometry of Numbers
  Mathematical Programming A, 2002; 123-127.
  (With: Yanjun Li)
  
  
• Balanced 0+-1 Matrices Part I: Decomposition
  Journal of Combinatorial Theory B, 2001; 243-274.
  (With: Michele Conforti, Ajai Kapoor, Kristina Vuskovic)
  
  
• Balanced 0+-1 Matrices Part II: Recognition Algorithm
  Journal of Combinatorial Theory B, 2001; 275-306.
  (With: Michele Conforti, Ajai Kapoor, Kristina Vuskovic)
  
  
• On Padberg's Conjecture about Almost Totally Unimodular Matrices
  Operations Research Letters 27, 2000; 97-99.
  (With: Luis F. Zuluaga)
  
  
• The Packing Property
  Mathematical Programming A, 2000; 113-126.
  (With: François Margot, B. Guenin)
  
  
• Decomposition of Balanced Matrices
  Journal of Combinatorial Theory B, 1999; 292-406.
  (With: Michele Conforti, M. Rao)
  
  
• Decomposition of Balanced Matrices
  Journal of Combinatorial Theory, 1999.
  (With: Michele Conforti, M. Rao)
  
  
• The Packing Property
  Lecture Notes in Computer Science, 1998; 1-8.
  (With: François Margot, B. Guenin)
  
  

Working Papers: 

• On the Relative Strength of Split, Triangle and Quadrilateral Cuts
  December, 2008.
  (With: Amitabh Basu, Pierre Bonami, François Margot)
  
  
• Projected Chvatal-Gomory cuts for mixed integer linear programs
  December, 2005.
  (With: Pierre Bonami, Sanjeeb Dash, Lodi, Andrea Fischetti, Matteo)
  
  

Publications: 

• Combinatorial Optimization: Packing and Covering, SIAM, (January, 2001).
  
  

Awards:

• 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

Editorial Boards:

• Mathematics of Operations Research (Advisory Board), 2004-Present
• RAIRO (Advisory Board), 2004-Present
• Mathematics of Operations Research (Editor-in-Chief), 1999-2003