Tight bounds for christofides' traveling salesman heuristic. - Gérard Cornuéjols; George L. Nemhauser (Math. Program., 1978)

A matching problem with side conditions. - Gérard Cornuéjols; William R. Pulleyblank (Discret. Math., 1980)

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem. - Gérard Cornuéjols; George L. Nemhauser; Laurence A. Wolsey (Oper. Res., 1980)

A Canonical Representation of Simple Plant Location Problems and Its Applications. - Gérard Cornuéjols; George L. Nemhauser; Laurence A. Wolsey (SIAM J. Algebraic Discret. Methods, 1980)

Some facets of the simple plant location polytope. - Gérard Cornuéjols; Jean-Michel Thizy (Math. Program., 1982)

Packing subgraphs in a graph. - Gérard Cornuéjols; David Hartvigsen; William R. Pulleyblank (Oper. Res. Lett., 1982)

Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem. - Gérard Cornuéjols; William R. Pulleyblank (Comb., 1983)

Halin graphs and the travelling salesman problem. - Gérard Cornuéjols; Denis Naddef; William R. Pulleyblank (Math. Program., 1983)

Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. - Michele Conforti; Gérard Cornuéjols (Discret. Appl. Math., 1984)

Compositions for perfect graphs. - Gérard Cornuéjols; William H. Cunningham (Discret. Math., 1985)

The traveling salesman problem on a graph and some related integer polyhedra. - Gérard Cornuéjols; Jean Fonlupt; Denis Naddef (Math. Program., 1985)

The Traveling Salesman Problem in Graphs with 3-Edge Cutsets - Gérard Cornuéjols; Denis Naddef; William R. Pulleyblank (J. ACM, 1985)

An extension of matching theory. - Gérard Cornuéjols; David Hartvigsen (J. Comb. Theory B, 1986)

Two algorithms for weighted matroid intersection. - Carl Brezovec; Gérard Cornuéjols; Fred W. Glover (Math. Program., 1986)

An algorithmic framework for the matching problem in some hypergraphs. - Michele Conforti; Gérard Cornuéjols (Networks, 1987)

General factors of graphs. - Gérard Cornuéjols (J. Comb. Theory B, 1988)

Probabilistic Analysis of a Relaxation for the k-Median Problem. - Sang Ahn; Colin Cooper; Gérard Cornuéjols; Alan M. Frieze (Math. Oper. Res., 1988)

A matroid algorithm and its application to the efficient solution of two optimization problems on graphs. - Carl Brezovec; Gérard Cornuéjols; Fred W. Glover (Math. Program., 1988)

On the 0, 1 facets of the set covering polytope. - Gérard Cornuéjols; Antonio Sassano (Math. Program., 1989)

A Decomposition Theorem for Balanced Matrices. - Michele Conforti; Gérard Cornuéjols (IPCO, 1990)

A Projection Method for the Uncapacitated Facility Location Problem. - Andrew R. Conn; Gérard Cornuéjols (Math. Program., 1990)

A Class of Logic Problems Solvable by Linear Programming - Michele Conforti; Gérard Cornuéjols (FOCS, 1992)

Polyhedral methods for the maximum clique problem. - Egon Balas; Sebastián Ceria; Gérard Cornuéjols; Gábor Pataki (Cliques, Coloring, and Satisfiability, 1993)

Solving Mixed 0-1 Programs by a Lift-and-Project Method. - Egon Balas; Sebastián Ceria; Gérard Cornuéjols (SODA, 1993)

Complete Multi-partite Cutsets in Minimal Imperfect Graphs. - Gérard Cornuéjols; Bruce A. Reed (J. Comb. Theory B, 1993)

A lift-and-project cutting plane algorithm for mixed 0-1 programs. - Egon Balas; Sebastián Ceria; Gérard Cornuéjols (Math. Program., 1993)

Polyhedral study of the capacitated vehicle routing problem. - Gérard Cornuéjols; Farid Harche (Math. Program., 1993)

Recognizing Balanced 0, +/- Matrices. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (SODA, 1994)

Ideal 0, 1 Matrices. - Gérard Cornuéjols; Beth Novick (J. Comb. Theory B, 1994)

From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes. - Michele Conforti; Gérard Cornuéjols; Klaus Truemper (Math. Oper. Res., 1994)

Combining and Strengthening Gomory Cuts. - Sebastián Ceria; Gérard Cornuéjols; Milind Dawande (IPCO, 1995)

A Mickey-Mouse Decomposition Theorem. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (IPCO, 1995)

Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. - Michele Conforti; Gérard Cornuéjols; M. R. Rao (Discret. Appl. Math., 1995)

Balanced 0, +-1-matrixces, bicoloring and total dual integrality. - Michele Conforti; Gérard Cornuéjols (Math. Program., 1995)

Perfect Matchings in Balanced Hypergraphs. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (Comb., 1996)

Gomory cuts revisited. - Egon Balas; Sebastián Ceria; Gérard Cornuéjols; N. Natraj (Oper. Res. Lett., 1996)

Decomposition of Integer Programs and of Generating Sets. - Gérard Cornuéjols; Regina Urbaniak; Robert Weismantel; Laurence A. Wolsey (ESA, 1997)

Finding an Even Hole in a Graph. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (FOCS, 1997)

Universally Signable Graphs. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (Comb., 1997)

A Class of Hard Small 0-1 Programs. - Gérard Cornuéjols; Milind Dawande (IPCO, 1998)

The Packing Property. - Gérard Cornuéjols; Bertrand Guenin; François Margot (IPCO, 1998)

Foreword. - Gérard Cornuéjols; William R. Pulleyblank (Discret. Appl. Math., 1998)

Balanced cycles and holes in bipartite graphs. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (Discret. Math., 1999)

Decomposition of Balanced Matrices. - Michele Conforti; Gérard Cornuéjols; M. R. Rao (J. Comb. Theory B, 1999)

Even and odd holes in cap-free graphs. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 1999)

Triangle-free graphs that are signable without even holes. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 2000)

On Padberg's conjecture about almost totally unimodular matrices. - Gérard Cornuéjols; Luis Fernando Zuluaga (Oper. Res. Lett., 2000)

On the Rank of Mixed 0, 1 Polyhedra. - Gérard Cornuéjols; Yanjun Li (IPCO, 2001)

Perfect, ideal and balanced matrices. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (Eur. J. Oper. Res., 2001)

Balanced 0-1 Matrices I. Decomposition. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Comb. Theory B, 2001)

Balanced 0-1 Matrices II. Recognition Algorithm. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Comb. Theory B, 2001)

Elementary closures for integer programs. - Gérard Cornuéjols; Yanjun Li (Oper. Res. Lett., 2001)

Split Closure and Intersection Cuts. - Kent Andersen; Gérard Cornuéjols; Yanjun Li (IPCO, 2002)

Perfect Graphs, Partitionable Graphs and Cutsets. - Michele Conforti; Gérard Cornuéjols; Grigor Gasparyan; Kristina Vuskovic (Comb., 2002)

Ideal clutters. - Gérard Cornuéjols; Bertrand Guenin (Discret. Appl. Math., 2002)

On dijoins. - Gérard Cornuéjols; Bertrand Guenin (Discret. Math., 2002)

Even-hole-free graphs part II: Recognition algorithm. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 2002)

Even-hole-free graphs part I: Decomposition theorem. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 2002)

A connection between cutting plane theory and the geometry of numbers. - Gérard Cornuéjols; Yanjun Li (Math. Program., 2002)

Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. - Gérard Cornuéjols; Bertrand Guenin (SIAM J. Discret. Math., 2002)

A Polynomial Algorithm for Recognizing Perfect Graphs. - Gérard Cornuéjols; Xinming Liu; Kristina Vuskovic (FOCS, 2003)

K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau. - Gérard Cornuéjols; Yanjun Li; Dieter Vandenbussche (INFORMS J. Comput., 2003)

Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. - Michele Conforti; Gérard Cornuéjols (J. Comb. Theory B, 2003)

A class of perfect graphs containing P6. - Gérard Cornuéjols; Xinming Liu (J. Comb. Theory B, 2003)

Integer programming. - Gérard Cornuéjols; William R. Pulleyblank (Math. Program., 2003)

Bicolorings and Equitable Bicolorings of Matrices. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (The Sharpest Cut, 2004)

Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (Discret. Appl. Math., 2004)

Square-free perfect graphs. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (J. Comb. Theory B, 2004)

Recognizing Berge Graphs. - Maria Chudnovsky; Gérard Cornuéjols; Xinming Liu; Paul D. Seymour; Kristina Vuskovic (Comb., 2005)

Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts. - Kent Andersen; Gérard Cornuéjols; Yanjun Li (Manag. Sci., 2005)

Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Comb., 2006)

Balanced matrices. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (Discret. Math., 2006)

Early Estimates of the Size of Branch-and-Bound Trees. - Gérard Cornuéjols; Miroslav Karamanov; Yanjun Li (INFORMS J. Comput., 2006)

A convex-analysis perspective on disjunctive cuts. - Gérard Cornuéjols; Claude Lemaréchal (Math. Program., 2006)

Odd Hole Recognition in Graphs of Bounded Clique Size. - Michele Conforti; Gérard Cornuéjols; Xinming Liu; Kristina Vuskovic; Giacomo Zambelli (SIAM J. Discret. Math., 2006)

Revival of the Gomory cuts in the 1990's. - Gérard Cornuéjols (Ann. Oper. Res., 2007)

On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints. - Gérard Cornuéjols; François Margot (LATIN, 2008)

An algorithmic framework for convex mixed integer nonlinear programs. - Pierre Bonami; Lorenz T. Biegler; Andrew R. Conn; Gérard Cornuéjols; Ignacio E. Grossmann; Carl D. Laird; Jon Lee 001; Andrea Lodi 001; François Margot; Nicolas W. Sawaya; Andreas Wächter (Discret. Optim., 2008)

Projected Chvátal-Gomory cuts for mixed integer linear programs. - Pierre Bonami; Gérard Cornuéjols; Sanjeeb Dash; Matteo Fischetti; Andrea Lodi 001 (Math. Program., 2008)

Valid inequalities for mixed integer linear programs. - Gérard Cornuéjols (Math. Program., 2008)

A note on the MIR closure. - Pierre Bonami; Gérard Cornuéjols (Oper. Res. Lett., 2008)

Review of combinatorial optimization: packing and covering. - Gérard Cornuéjols (SIGACT News, 2008)

Improved Strategies for Branching on General Disjunctions. - Gérard Cornuéjols; Leo Liberti; Giacomo Nannicini (CTW, 2009)

On the relative strength of split, triangle and quadrilateral cuts. - Amitabh Basu; Pierre Bonami; Gérard Cornuéjols; François Margot (SODA, 2009)

The Chvátal closure of generalized stable sets in bidirected graphs. - Manoel B. Campêlo; Gérard Cornuéjols (Electron. Notes Discret. Math., 2009)

Lehman matrices. - Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (J. Comb. Theory B, 2009)

Minimal Valid Inequalities for Integer Constraints. - Valentin Borozan; Gérard Cornuéjols (Math. Oper. Res., 2009)

A Feasibility Pump for mixed integer nonlinear programs. - Pierre Bonami; Gérard Cornuéjols; Andrea Lodi 001; François Margot (Math. Program., 2009)

Stable sets, corner polyhedra and the Chvátal closure. - Manoel B. Campêlo; Gérard Cornuéjols (Oper. Res. Lett., 2009)

Polyhedral Approaches to Mixed Integer Linear Programming. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (50 Years of Integer Programming, 2010)

On Lifting Integer Variables in Minimal Inequalities. - Amitabh Basu; Manoel B. Campêlo; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (IPCO, 2010)

Extended formulations in combinatorial optimization. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (4OR, 2010)

Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications. - Hassan L. Hijazi; Pierre Bonami; Gérard Cornuéjols; Adam Ouorou (Electron. Notes Discret. Math., 2010)

Maximal Lattice-Free Convex Sets in Linear Subspaces. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Math. Oper. Res., 2010)

Equivalence between intersection cuts and the corner polyhedron. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Oper. Res. Lett., 2010)

Minimal Inequalities for an Infinite Relaxation of Integer Programs. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (SIAM J. Discret. Math., 2010)

A Probabilistic Analysis of the Strength of the Split and Triangle Closures. - Amitabh Basu; Gérard Cornuéjols; Marco Molinaro 001 (IPCO, 2011)

Experiments with Two-Row Cuts from Degenerate Tableaux. - Amitabh Basu; Pierre Bonami; Gérard Cornuéjols; François Margot (INFORMS J. Comput., 2011)

A Geometric Perspective on Lifting. - Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Oper. Res., 2011)

Branching on general disjunctions. - Miroslav Karamanov; Gérard Cornuéjols (Math. Program., 2011)

Practical strategies for generating rank-1 split cuts in mixed-integer linear programming. - Gérard Cornuéjols; Giacomo Nannicini (Math. Program. Comput., 2011)

Branching on Split Disjunctions. - Giacomo Nannicini; Gérard Cornuéjols; Miroslav Karamanov; Leo Liberti (Combinatorial Optimization - Methods and Applications, 2011)

Mixed-integer nonlinear programs featuring "on/off" constraints. - Hassan L. Hijazi; Pierre Bonami; Gérard Cornuéjols; Adam Ouorou (Comput. Optim. Appl., 2012)

How tight is the corner relaxation? Insights gained from the stable set problem. - Gérard Cornuéjols; Carla Michini; Giacomo Nannicini (Discret. Optim., 2012)

Unique Minimal Liftings for Simplicial Polytopes. - Amitabh Basu; Gérard Cornuéjols; Matthias Köppe (Math. Oper. Res., 2012)

Intersection Cuts with Infinite Split Rank. - Amitabh Basu; Gérard Cornuéjols; François Margot (Math. Oper. Res., 2012)

A counterexample to a conjecture of Gomory and Johnson. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Math. Program., 2012)

Cut-Generating Functions. - Michele Conforti; Gérard Cornuéjols; Aris Daniilidis; Claude Lemaréchal; Jérôme Malick (IPCO, 2013)

Combining Lift-and-Project and Reduce-and-Split. - Egon Balas; Gérard Cornuéjols; Tamás Kis; Giacomo Nannicini (INFORMS J. Comput., 2013)

Unique lifting of integer variables in minimal inequalities. - Amitabh Basu; Manoel B. Campêlo; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Math. Program., 2013)

A 3-Slope Theorem for the infinite relaxation in the plane. - Gérard Cornuéjols; Marco Molinaro 001 (Math. Program., 2013)

On the safety of Gomory cut generators. - Gérard Cornuéjols; François Margot; Giacomo Nannicini (Math. Program. Comput., 2013)

Cutting planes from two-term disjunctions. - Pierre Bonami; Michele Conforti; Gérard Cornuéjols; Marco Molinaro 001; Giacomo Zambelli (Oper. Res. Lett., 2013)

Lifting Gomory cuts with bounded variables. - Gérard Cornuéjols; Tamás Kis; Marco Molinaro 001 (Oper. Res. Lett., 2013)

Cut-Generating Functions and S-Free Sets. - Michele Conforti; Gérard Cornuéjols; Aris Daniilidis; Claude Lemaréchal; Jérôme Malick (Math. Oper. Res., 2015)

On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. - Yogesh Awate; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (Math. Program., 2015)

Special issue of Mathematical Programming, Series B, dedicated to the international symposium on mathematical programming, Pittsburgh, July 2015. - Gérard Cornuéjols; Andrew J. Schaefer (Math. Program., 2015)

Sufficiency of cut-generating functions. - Gérard Cornuéjols; Laurence A. Wolsey; Sercan Yildiz (Math. Program., 2015)

Disjunctive cuts for cross-sections of the second-order cone. - Sercan Yildiz; Gérard Cornuéjols (Oper. Res. Lett., 2015)

On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal Rank. - Gérard Cornuéjols; Dabeen Lee (IPCO, 2016)

Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point. - Gérard Cornuéjols; Yanjun Li (IPCO, 2016)

Cut-Generating Functions for Integer Variables. - Sercan Yildiz; Gérard Cornuéjols (Math. Oper. Res., 2016)

Optimality certificates for convex minimization and Helly numbers. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Robert Weismantel; Stefan Weltge (Oper. Res. Lett., 2017)

From estimation to optimization via shrinkage. - Danial Davarnia; Gérard Cornuéjols (Oper. Res. Lett., 2017)

Ideal Clutters That Do Not Pack. - Ahmad Abdi; Kanstantsin Pashkovich; Gérard Cornuéjols (Math. Oper. Res., 2018)

When the Gomory-Chvátal closure coincides with the integer hull. - Gérard Cornuéjols; Yanjun Li (Oper. Res. Lett., 2018)

Identically Self-blocking Clutters. - Ahmad Abdi; Gérard Cornuéjols; Dabeen Lee (IPCO, 2019)

Idealness and 2-resistant sets. - Ahmad Abdi; Gérard Cornuéjols (Oper. Res. Lett., 2019)

Idealness of k-wise Intersecting Families. - Ahmad Abdi; Gérard Cornuéjols; Tony Huynh; Dabeen Lee (IPCO, 2020)

Intersecting Restrictions in Clutters. - Ahmad Abdi; Gérard Cornuéjols; Dabeen Lee (Comb., 2020)

Cuboids, a class of clutters. - Ahmad Abdi; Gérard Cornuéjols; Natália Guricanová; Dabeen Lee (J. Comb. Theory B, 2020)

On the Rational Polytopes with Chvátal Rank 1. - Gérard Cornuéjols; Dabeen Lee; Yanjun Li (Math. Program., 2020)

Computational Aspects of Bayesian Solution Estimators in Stochastic Optimization. - Danial Davarnia; Burak Kocuk; Gérard Cornuéjols (INFORMS J. Optim., 2020)

The max-flow min-cut property and ±1-resistant sets. - Ahmad Abdi; Gérard Cornuéjols (Discret. Appl. Math., 2021)

A new infinite class of ideal minimally non-packing clutters. - Ahmad Abdi; Gérard Cornuéjols; Matt Superdock (Discret. Math., 2021)

Resistant Sets in the Unit Hypercube. - Ahmad Abdi; Gérard Cornuéjols; Dabeen Lee (Math. Oper. Res., 2021)

Total Dual Dyadicness and Dyadic Generating Sets. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (IPCO, 2022)

Clean tangled clutters, simplices, and projective geometries. - Ahmad Abdi; Gérard Cornuéjols; Matt Superdock (J. Comb. Theory B, 2022)

Correction to: Idealness of k-wise intersecting families. - Ahmad Abdi; Gérard Cornuéjols; Tony Huynh; Dabeen Lee (Math. Program., 2022)

Testing idealness in the filter oracle model. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (Oper. Res. Lett., 2022)

Clean Clutters and Dyadic Fractional Packings. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (SIAM J. Discret. Math., 2022)

On Dyadic Fractional Packings of $T$-Joins. - Ahmad Abdi; Gérard Cornuéjols; Zuzanna Palion (SIAM J. Discret. Math., 2022)

Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization. - Gérard Cornuéjols; Yatharth Dubey (CoRR, 2023)

On Packing Dijoins in Digraphs and Weighted Digraphs. - Ahmad Abdi; Gérard Cornuéjols; Michael Zlatin (SIAM J. Discret. Math., 2023)

Approximately Packing Dijoins via Nowhere-Zero Flows. - Gérard Cornuéjols; Siyue Liu; R. Ravi 001 (IPCO, 2024)

Reducing the Chvátal rank through binarization. - Gérard Cornuéjols; Vrishabh Patil (Oper. Res. Lett., 2024)

Arc Connectivity and Submodular Flows in Digraphs. - Ahmad Abdi; Gérard Cornuéjols; Giacomo Zambelli (Comb., 2024)

Erratum to: Arc Connectivity and Submodular Flows in Digraphs. - Ahmad Abdi; Gérard Cornuéjols; Giacomo Zambelli (Comb., 2024)

Strongly Connected Orientations and Integer Lattices. - Ahmad Abdi; Gérard Cornuéjols; Siyue Liu; Olha Silina (IPCO, 2025)

Packing Dijoins in Weighted Chordal Digraphs. - Gérard Cornuéjols; Siyue Liu; R. Ravi 001 (CoRR, 2025)

Dyadic linear programming and extensions. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (Math. Program., 2025)