- Digital Object Identifier (DOI) 10.1007/s10107-004-0558-z Math. Program., Ser. A 102: 457493 (2005)
- Even-Hole-Free Graphs Part I: Decomposition Theorem
- Extended Formulations in Combinatorial Optimization
- A probabilistic analysis of the strength of the split and triangle Amitabh Basu Gerard Cornuejols Marco Molinaro
- Perfect Graphs, Partitionable Graphs and Cutsets Michele Conforti
- Unique lifting of integer variables in minimal inequalities Amitabh Basu1
- On Lifting Integer Variables in Minimal Inequalities Amitabh Basu1,2
- A Probabilistic Analysis of the Strength of the Split and Triangle Closures
- Noname manuscript No. (will be inserted by the editor)
- Mathematical Programming manuscript No. (will be inserted by the editor)
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Mathematical Programming manuscript No. (will be inserted by the editor)
- A Note on the MIR closure Pierre Bonami 1
- Early Estimates of the Size of Branch-and-Bound Trees
- Recognizing Berge Graphs Maria Chudnovsky, Princeton University, Princeton, NJ
- Odd Hole Recognition in Graphs of Bounded Clique Size Michele Conforti
- Balanced 0 1 Matrices Part II: Recognition Algorithm
- IDEAL BINARY CLUTTERS, CONNECTIVITY, AND A CONJECTURE OF SEYMOUR G ERARD CORNUEJOLS AND BERTRAND GUENIN
- Early Estimates of the Size of BranchandBound Trees
- Convex Sets and Minimal Sublinear Functions Amitabh Basu
- Recognizing Berge Graphs Maria Chudnovsky, Princeton University, Princeton, NJ
- Decomposing Berge Graphs Containing Proper Wheels
- Corner Polyhedron and Intersection Cuts Michele Conforti1,5
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
- Odd Hole Recognition in Graphs of Bounded Clique Size Michele Conforti
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
- How tight is the corner relaxation? Gerard Cornuejols
- IDEAL BINARY CLUTTERS, CONNECTIVITY, AND A CONJECTURE OF SEYMOUR ERARD CORNU
- LEHMAN MATRICES ERARD CORNU
- The Strong Perfect Graph Conjecture G erard Cornu ejols
- Revival of the Gomory cuts in the 1990's G erard Cornu ejols
- Even-Hole-Free Graphs Part II: Recognition Algorithm
- A Connection Between Cutting Plane Theory and the Geometry of Numbers
- Reduceandsplit cuts: Improving the performance of mixed integer Gomory cuts 1
- THE PACKING PROPERTY GERARD CORNUEJOLS, BERTRAND GUENIN, AND FRANCOIS MARGOT
- Multi-Row Cutting Planes Corner Polyhedron, Intersection Cuts,
- Mathematical Programming manuscript No. (will be inserted by the editor)
- Mathematical Programming manuscript No. (will be inserted by the editor)
- Combining Lift-and-Project and Reduce-and-Split Tepper School of Business, Carnegie Mellon University, PA
- The Strong Perfect Graph Theorem G erard Cornu ejols
- On the Relative Strength of Split, Triangle and Quadrilateral Cuts
- Stable sets, corner polyhedra and the Chvatal closure Manoel Camp^elo
- A 3-Slope Theorem for the Infinite Relaxation in the Plane Gerard Cornuejols1,3
- On Padberg's conjecture about almost totally unimodular matrices
- Bicolorings and Equitable Bicolorings of Matrices Michele Conforti G erard Cornu ejols y Giacomo Zambelli y
- Combinatorial Optimization: Packing and Covering
- Minimal inequalities for an infinite relaxation of integer programs
- Graphs without Odd Holes, Parachutes or Proper Wheels: A Generalization of Meyniel Graphs
- Ideal Clutters G erard Cornu ejols
- Polyhedral Approaches to Mixed Integer Linear Programming
- Mixed-Integer Nonlinear Programs featuring "on/off" constraints Hassan Hijazi Pierre Bonami Gerard Cornuejols
- Mathematical Programming manuscript No. (will be inserted by the editor)
- Math. Program., Ser. A (2008) 113:241257 DOI 10.1007/s10107-006-0051-y
- An algorithmic framework for convex mixed integer nonlinear programs
- A Counterexample to a Conjecture of Gomory and Johnson Amitabh Basu
- Combinatorial Optimization: Packing and Covering
- Decomposition of Balanced Matrices Michele Conforti Gerard Cornuejols y and M. R. Rao z
- Reduce-and-split cuts: Improving the performance of mixed integer Gomory cuts 1
- Polyhedral Approaches to Mixed Integer Linear Programming
- Intersection Cuts with Infinite Split Rank Amitabh Basu1,2
- Elementary Closures for Integer Programs Gerard Cornuejols Yanjun Li
- LEHMAN MATRICES Gerard Cornuejols
- S eminaire BOURBAKI Mars 2006 58 eme ann ee, 2005-2006, n o 957
- A Class of Perfect Graphs Containing P 6 G erard Cornu ejols and Xinming Liu
- Decomposing Berge graphs containing no proper wheel, long prism or their complements
- Convex Sets and Minimal Sublinear Functions Amitabh Basu # Gerard Cornuejols + Giacomo Zambelli #
- Square-Free Perfect Graphs Michele Conforti
- Mathematical Programming manuscript No. (will be inserted by the editor)
- A NOTE ON DIJOINS G ERARD CORNUEJOLS AND BERTRAND GUENIN
- Maximal lattice-free convex sets in linear subspaces Amitabh Basu
- A geometric perspective on lifting Michele Conforti
- Mathematical Programming manuscript No. (will be inserted by the editor)
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
- Mathematical Programming manuscript No. (will be inserted by the editor)
- LEHMAN MATRICES GERARD CORNUEJOLS, BERTRAND GUENIN, LEVENT TUNC EL
- Mathematical Programming manuscript No. (will be inserted by the editor)
- Decomposition of Odd-hole-free Graphs by Double Star Cutsets and 2-Joins
- Branching on Split Disjunctions G. NANNICINI a,1
- Balanced 0 1 Matrices Part I: Decomposition
- A geometric perspective on lifting Michele Conforti
- Unique Minimal Liftings for Simplicial Polytopes Amitabh Basu
- Multi-Row Cuts Integer Lifting
- Unique Minimal Liftings for Simplicial Polytopes Amitabh Basu
- Noname manuscript No. (will be inserted by the editor)
- Unique lifting of integer variables in minimal inequalities Amitabh Basu1
- Lifting Gomory Cuts With Bounded Variables Gerard Cornuejols
- Multi-Row Cuts Integer Lifting