Gérard Cornuéjols

167 papers A* 6A 1B 20C 1Journal 135Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Approximately Packing Dijoins via Nowhere-Zero Flows.
Comb.
Gérard Cornuéjols, Siyue Liu, R. Ravi
2025 J jnl
Dyadic linear programming and extensions.
Math. Program.
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2025 J jnl
Packing Dijoins in Weighted Chordal Digraphs.
CoRR
Gérard Cornuéjols, Siyue Liu, R. Ravi
2025 B conf
Strongly Connected Orientations and Integer Lattices.
IPCO
Ahmad Abdi, Gérard Cornuéjols, Siyue Liu, Olha Silina
2024 B conf
Approximately Packing Dijoins via Nowhere-Zero Flows.
IPCO
Gérard Cornuéjols, Siyue Liu, R. Ravi
2024 J jnl
Arc Connectivity and Submodular Flows in Digraphs.
Comb.
Ahmad Abdi, Gérard Cornuéjols, Giacomo Zambelli
2024 J jnl
Erratum to: Arc Connectivity and Submodular Flows in Digraphs.
Comb.
Ahmad Abdi, Gérard Cornuéjols, Giacomo Zambelli
2024 J jnl
Reducing the Chvátal rank through binarization.
Oper. Res. Lett.
Gérard Cornuéjols, Vrishabh Patil
2024 J jnl
Total dual dyadicness and dyadic generating sets.
Math. Program.
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2023 J jnl
Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization.
CoRR
Gérard Cornuéjols, Yatharth Dubey
2023 J jnl
On Packing Dijoins in Digraphs and Weighted Digraphs.
SIAM J. Discret. Math.
Ahmad Abdi, Gérard Cornuéjols, Michael Zlatin
2022 J jnl
Clean Clutters and Dyadic Fractional Packings.
SIAM J. Discret. Math.
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2022 J jnl
Clean tangled clutters, simplices, and projective geometries.
J. Comb. Theory B
Ahmad Abdi, Gérard Cornuéjols, Matt Superdock
2022 J jnl
Correction to: Idealness of k-wise intersecting families.
Math. Program.
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
2022 J jnl
Idealness of k-wise intersecting families.
Math. Program.
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
2022 J jnl
On Dyadic Fractional Packings of $T$-Joins.
SIAM J. Discret. Math.
Ahmad Abdi, Gérard Cornuéjols, Zuzanna Palion
2022 J jnl
Testing idealness in the filter oracle model.
Oper. Res. Lett.
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2022 B conf
Total Dual Dyadicness and Dyadic Generating Sets.
IPCO
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2021 J jnl
A new infinite class of ideal minimally non-packing clutters.
Discret. Math.
Ahmad Abdi, Gérard Cornuéjols, Matt Superdock
2021 J jnl
Resistant Sets in the Unit Hypercube.
Math. Oper. Res.
Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee
2021 J jnl
The max-flow min-cut property and ±1-resistant sets.
Discret. Appl. Math.
Ahmad Abdi, Gérard Cornuéjols
2020 J jnl
Computational Aspects of Bayesian Solution Estimators in Stochastic Optimization.
INFORMS J. Optim.
Danial Davarnia, Burak Kocuk, Gérard Cornuéjols
2020 J jnl
Cuboids, a class of clutters.
J. Comb. Theory B
Ahmad Abdi, Gérard Cornuéjols, Natália Guricanová, Dabeen Lee
2020 B conf
Idealness of k-wise Intersecting Families.
IPCO
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
2020 J jnl
Intersecting Restrictions in Clutters.
Comb.
Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee
2020 J jnl
On the Rational Polytopes with Chvátal Rank 1.
Math. Program.
Gérard Cornuéjols, Dabeen Lee, Yanjun Li
2019 J jnl
Idealness and 2-resistant sets.
Oper. Res. Lett.
Ahmad Abdi, Gérard Cornuéjols
2019 J jnl
Idealness of k-wise intersecting families.
CoRR
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
2019 B conf
Identically Self-blocking Clutters.
IPCO
Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee
2018 J jnl
Ideal Clutters That Do Not Pack.
Math. Oper. Res.
Ahmad Abdi, Kanstantsin Pashkovich, Gérard Cornuéjols
2018 J jnl
On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank.
Math. Program.
Gérard Cornuéjols, Dabeen Lee
2018 J jnl
When the Gomory-Chvátal closure coincides with the integer hull.
Oper. Res. Lett.
Gérard Cornuéjols, Yanjun Li
2017 J jnl
From estimation to optimization via shrinkage.
Oper. Res. Lett.
Danial Davarnia, Gérard Cornuéjols
2017 J jnl
Optimality certificates for convex minimization and Helly numbers.
Oper. Res. Lett.
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Robert Weismantel, Stefan Weltge
2016 J jnl
Cut-Generating Functions for Integer Variables.
Math. Oper. Res.
Sercan Yildiz, Gérard Cornuéjols
2016 B conf
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point.
IPCO
Gérard Cornuéjols, Yanjun Li
2016 B conf
On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal Rank.
IPCO
Gérard Cornuéjols, Dabeen Lee
2015 J jnl
Cut-Generating Functions and
Math. Oper. Res.
Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick
2015 J jnl
Disjunctive cuts for cross-sections of the second-order cone.
Oper. Res. Lett.
Sercan Yildiz, Gérard Cornuéjols
2015 J jnl
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs.
Math. Program.
Yogesh Awate, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2015 J jnl
Special issue of Mathematical Programming, Series B, dedicated to the international symposium on mathematical programming, Pittsburgh, July 2015.
Math. Program.
Gérard Cornuéjols, Andrew J. Schaefer
2015 J jnl
Sufficiency of cut-generating functions.
Math. Program.
Gérard Cornuéjols, Laurence A. Wolsey, Sercan Yildiz
2013 J jnl
A 3-Slope Theorem for the infinite relaxation in the plane.
Math. Program.
Gérard Cornuéjols, Marco Molinaro
2013 J jnl
Combining Lift-and-Project and Reduce-and-Split.
INFORMS J. Comput.
Egon Balas, Gérard Cornuéjols, Tamás Kis, Giacomo Nannicini
2013 B conf
Cut-Generating Functions.
IPCO
Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick
2013 J jnl
Cutting planes from two-term disjunctions.
Oper. Res. Lett.
Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli
2013 J jnl
Extended formulations in combinatorial optimization.
Ann. Oper. Res.
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2013 J jnl
Lifting Gomory cuts with bounded variables.
Oper. Res. Lett.
Gérard Cornuéjols, Tamás Kis, Marco Molinaro
2013 J jnl
On the safety of Gomory cut generators.
Math. Program. Comput.
Gérard Cornuéjols, François Margot, Giacomo Nannicini
2013 J jnl
Unique lifting of integer variables in minimal inequalities.
Math. Program.
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2012 J jnl
A counterexample to a conjecture of Gomory and Johnson.
Math. Program.
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2012 J jnl
How tight is the corner relaxation? Insights gained from the stable set problem.
Discret. Optim.
Gérard Cornuéjols, Carla Michini, Giacomo Nannicini
2012 J jnl
Intersection Cuts with Infinite Split Rank.
Math. Oper. Res.
Amitabh Basu, Gérard Cornuéjols, François Margot
2012 J jnl
Mixed-integer nonlinear programs featuring "on/off" constraints.
Comput. Optim. Appl.
Hassan L. Hijazi, Pierre Bonami, Gérard Cornuéjols, Adam Ouorou
2012 J jnl
Unique Minimal Liftings for Simplicial Polytopes.
Math. Oper. Res.
Amitabh Basu, Gérard Cornuéjols, Matthias Köppe
2011 J jnl
A Geometric Perspective on Lifting.
Oper. Res.
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2011 B conf
A Probabilistic Analysis of the Strength of the Split and Triangle Closures.
IPCO
Amitabh Basu, Gérard Cornuéjols, Marco Molinaro
2011 — ch.
Branching on Split Disjunctions.
Combinatorial Optimization - Methods and Applications
Giacomo Nannicini, Gérard Cornuéjols, Miroslav Karamanov, Leo Liberti
2011 J jnl
Branching on general disjunctions.
Math. Program.
Miroslav Karamanov, Gérard Cornuéjols
2011 J jnl
Experiments with Two-Row Cuts from Degenerate Tableaux.
INFORMS J. Comput.
Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot
2011 J jnl
Improved strategies for branching on general disjunctions.
Math. Program.
Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini
2011 J jnl
On the relative strength of split, triangle and quadrilateral cuts.
Math. Program.
Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot
2011 J jnl
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming.
Math. Program. Comput.
Gérard Cornuéjols, Giacomo Nannicini
2010 J jnl
Equivalence between intersection cuts and the corner polyhedron.
Oper. Res. Lett.
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 J jnl
Extended formulations in combinatorial optimization.
4OR
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 J jnl
Maximal Lattice-Free Convex Sets in Linear Subspaces.
Math. Oper. Res.
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 J jnl
Minimal Inequalities for an Infinite Relaxation of Integer Programs.
SIAM J. Discret. Math.
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 J jnl
Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications.
Electron. Notes Discret. Math.
Hassan L. Hijazi, Pierre Bonami, Gérard Cornuéjols, Adam Ouorou
2010 B conf
On Lifting Integer Variables in Minimal Inequalities.
IPCO
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 — ch.
Polyhedral Approaches to Mixed Integer Linear Programming.
50 Years of Integer Programming
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2009 J jnl
A Feasibility Pump for mixed integer nonlinear programs.
Math. Program.
Pierre Bonami, Gérard Cornuéjols, Andrea Lodi, François Margot
2009 C conf
Improved Strategies for Branching on General Disjunctions.
CTW
Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini
2009 J jnl
Lehman matrices.
J. Comb. Theory B
Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2009 J jnl
Minimal Valid Inequalities for Integer Constraints.
Math. Oper. Res.
Valentin Borozan, Gérard Cornuéjols
2009 J jnl
On the facets of mixed integer programs with two integer variables and two constraints.
Math. Program.
Gérard Cornuéjols, François Margot
2009 A* conf
On the relative strength of split, triangle and quadrilateral cuts.
SODA
Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot
2009 J jnl
Stable sets, corner polyhedra and the Chvátal closure.
Oper. Res. Lett.
Manoel B. Campêlo, Gérard Cornuéjols
2009 J jnl
The Chvátal closure of generalized stable sets in bidirected graphs.
Electron. Notes Discret. Math.
Manoel B. Campêlo, Gérard Cornuéjols
2008 J jnl
A note on the MIR closure.
Oper. Res. Lett.
Pierre Bonami, Gérard Cornuéjols
2008 J jnl
An algorithmic framework for convex mixed integer nonlinear programs.
Discret. Optim.
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, François Margot, Nicolas W. Sawaya, Andreas Wächter
2008 B conf
On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints.
LATIN
Gérard Cornuéjols, François Margot
2008 J jnl
Projected Chvátal-Gomory cuts for mixed integer linear programs.
Math. Program.
Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi
2008 J jnl
Review of combinatorial optimization: packing and covering.
SIGACT News
Gérard Cornuéjols
2008 J jnl
Valid inequalities for mixed integer linear programs.
Math. Program.
Gérard Cornuéjols
2007 J jnl
Revival of the Gomory cuts in the 1990's.
Ann. Oper. Res.
Gérard Cornuéjols
2006 J jnl
A convex-analysis perspective on disjunctive cuts.
Math. Program.
Gérard Cornuéjols, Claude Lemaréchal
2006 J jnl
Balanced matrices.
Discret. Math.
Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
2006 J jnl
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements.
Comb.
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2006 J jnl
Early Estimates of the Size of Branch-and-Bound Trees.
INFORMS J. Comput.
Gérard Cornuéjols, Miroslav Karamanov, Yanjun Li
2006 J jnl
Odd Hole Recognition in Graphs of Bounded Clique Size.
SIAM J. Discret. Math.
Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli
2005 J jnl
Recognizing Berge Graphs.
Comb.
Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic
2005 J jnl
Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts.
Manag. Sci.
Kent Andersen, Gérard Cornuéjols, Yanjun Li
2005 J jnl
Split closure and intersection cuts.
Math. Program.
Kent Andersen, Gérard Cornuéjols, Yanjun Li
2004 — ch.
Bicolorings and Equitable Bicolorings of Matrices.
The Sharpest Cut
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2004 J jnl
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins.
Discret. Appl. Math.
Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
2004 J jnl
Square-free perfect graphs.
J. Comb. Theory B
Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
2003 A* conf
A Polynomial Algorithm for Recognizing Perfect Graphs.
FOCS
Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic
2003 J jnl
A class of perfect graphs containing
J. Comb. Theory B
Gérard Cornuéjols, Xinming Liu
2003 J jnl
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs.
J. Comb. Theory B
Michele Conforti, Gérard Cornuéjols
2003 J jnl
Integer programming.
Math. Program.
Gérard Cornuéjols, William R. Pulleyblank
2003 J jnl
K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau.
INFORMS J. Comput.
Gérard Cornuéjols, Yanjun Li, Dieter Vandenbussche
2002 J jnl
A connection between cutting plane theory and the geometry of numbers.
Math. Program.
Gérard Cornuéjols, Yanjun Li
2002 J jnl
Even-hole-free graphs part I: Decomposition theorem.
J. Graph Theory
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
2002 J jnl
Even-hole-free graphs part II: Recognition algorithm.
J. Graph Theory
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
2002 J jnl
Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour.
SIAM J. Discret. Math.
Gérard Cornuéjols, Bertrand Guenin
2002 J jnl
Ideal clutters.
Discret. Appl. Math.
Gérard Cornuéjols, Bertrand Guenin
2002 J jnl
On dijoins.
Discret. Math.
Gérard Cornuéjols, Bertrand Guenin
2002 J jnl
On the rank of mixed 0, 1 polyhedra.
Math. Program.
Gérard Cornuéjols, Yanjun Li
2002 J jnl
Perfect Graphs, Partitionable Graphs and Cutsets.
Comb.
Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic
2002 B conf
Split Closure and Intersection Cuts.
IPCO
Kent Andersen, Gérard Cornuéjols, Yanjun Li
2001 J jnl
Balanced 0-1 Matrices I. Decomposition.
J. Comb. Theory B
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
2001 J jnl
Balanced 0-1 Matrices II. Recognition Algorithm.
J. Comb. Theory B
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
2001 J jnl
Elementary closures for integer programs.
Oper. Res. Lett.
Gérard Cornuéjols, Yanjun Li
2001 B conf
On the Rank of Mixed 0, 1 Polyhedra.
IPCO
Gérard Cornuéjols, Yanjun Li
2001 J jnl
Perfect, ideal and balanced matrices.
Eur. J. Oper. Res.
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
2000 J jnl
On Padberg's conjecture about almost totally unimodular matrices.
Oper. Res. Lett.
Gérard Cornuéjols, Luis Fernando Zuluaga
2000 J jnl
The packing property.
Math. Program.
Gérard Cornuéjols, Bertrand Guenin, François Margot
2000 J jnl
Triangle-free graphs that are signable without even holes.
J. Graph Theory
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1999 J jnl
A Class of Hard Small 0-1 Programs.
INFORMS J. Comput.
Gérard Cornuéjols, Milind Dawande
1999 J jnl
Balanced cycles and holes in bipartite graphs.
Discret. Math.
Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
1999 J jnl
Decomposition of Balanced Matrices.
J. Comb. Theory B
Michele Conforti, Gérard Cornuéjols, M. R. Rao
1999 J jnl
Even and odd holes in cap-free graphs.
J. Graph Theory
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1999 B ed.
Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings
IPCO
Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger
1998 B conf
A Class of Hard Small 0-1 Programs.
IPCO
Gérard Cornuéjols, Milind Dawande
1998 J jnl
Foreword.
Discret. Appl. Math.
Gérard Cornuéjols, William R. Pulleyblank
1998 B conf
The Packing Property.
IPCO
Gérard Cornuéjols, Bertrand Guenin, François Margot
1997 A conf
Decomposition of Integer Programs and of Generating Sets.
ESA
Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey
1997 A* conf
Finding an Even Hole in a Graph.
FOCS
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1997 J jnl
Universally Signable Graphs.
Comb.
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1996 J jnl
Gomory cuts revisited.
Oper. Res. Lett.
Egon Balas, Sebastián Ceria, Gérard Cornuéjols, N. Natraj
1996 J jnl
Perfect Matchings in Balanced Hypergraphs.
Comb.
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1995 J jnl
A Class of Logic Problems Solvable by Linear Programming.
J. ACM
Michele Conforti, Gérard Cornuéjols
1995 B conf
A Mickey-Mouse Decomposition Theorem.
IPCO
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1995 J jnl
Balanced 0, +-1-matrixces, bicoloring and total dual integrality.
Math. Program.
Michele Conforti, Gérard Cornuéjols
1995 B conf
Combining and Strengthening Gomory Cuts.
IPCO
Sebastián Ceria, Gérard Cornuéjols, Milind Dawande
1995 J jnl
Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs.
Discret. Appl. Math.
Michele Conforti, Gérard Cornuéjols, M. R. Rao
1994 J jnl
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes.
Math. Oper. Res.
Michele Conforti, Gérard Cornuéjols, Klaus Truemper
1994 J jnl
Ideal 0, 1 Matrices.
J. Comb. Theory B
Gérard Cornuéjols, Beth Novick
1994 A* conf
Recognizing Balanced 0, +/- Matrices.
SODA
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
1993 J jnl
A lift-and-project cutting plane algorithm for mixed 0-1 programs.
Math. Program.
Egon Balas, Sebastián Ceria, Gérard Cornuéjols
1993 J jnl
Complete Multi-partite Cutsets in Minimal Imperfect Graphs.
J. Comb. Theory B
Gérard Cornuéjols, Bruce A. Reed
1993 — conf
Polyhedral methods for the maximum clique problem.
Cliques, Coloring, and Satisfiability
Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki
1993 J jnl
Polyhedral study of the capacitated vehicle routing problem.
Math. Program.
Gérard Cornuéjols, Farid Harche
1993 A* conf
Solving Mixed 0-1 Programs by a Lift-and-Project Method.
SODA
Egon Balas, Sebastián Ceria, Gérard Cornuéjols
1992 A* conf
A Class of Logic Problems Solvable by Linear Programming
FOCS
Michele Conforti, Gérard Cornuéjols
1992 B ed.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992
IPCO
Egon Balas, Gérard Cornuéjols, Ravi Kannan
1990 B conf
A Decomposition Theorem for Balanced Matrices.
IPCO
Michele Conforti, Gérard Cornuéjols
1990 J jnl
A Projection Method for the Uncapacitated Facility Location Problem.
Math. Program.
Andrew R. Conn, Gérard Cornuéjols
1989 J jnl
On the 0, 1 facets of the set covering polytope.
Math. Program.
Gérard Cornuéjols, Antonio Sassano
1988 J jnl
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs.
Math. Program.
Carl Brezovec, Gérard Cornuéjols, Fred W. Glover
1988 J jnl
General factors of graphs.
J. Comb. Theory B
Gérard Cornuéjols
1988 J jnl
Probabilistic Analysis of a Relaxation for the
Math. Oper. Res.
Sang Ahn, Colin Cooper, Gérard Cornuéjols, Alan M. Frieze
1987 J jnl
An algorithmic framework for the matching problem in some hypergraphs.
Networks
Michele Conforti, Gérard Cornuéjols
1986 J jnl
An extension of matching theory.
J. Comb. Theory B
Gérard Cornuéjols, David Hartvigsen
1986 J jnl
Two algorithms for weighted matroid intersection.
Math. Program.
Carl Brezovec, Gérard Cornuéjols, Fred W. Glover
1985 J jnl
Compositions for perfect graphs.
Discret. Math.
Gérard Cornuéjols, William H. Cunningham
1985 J jnl
The Traveling Salesman Problem in Graphs with 3-Edge Cutsets
J. ACM
Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank
1985 J jnl
The traveling salesman problem on a graph and some related integer polyhedra.
Math. Program.
Gérard Cornuéjols, Jean Fonlupt, Denis Naddef
1984 J jnl
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem.
Discret. Appl. Math.
Michele Conforti, Gérard Cornuéjols
1983 J jnl
Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem.
Comb.
Gérard Cornuéjols, William R. Pulleyblank
1983 J jnl
Halin graphs and the travelling salesman problem.
Math. Program.
Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank
1982 J jnl
Packing subgraphs in a graph.
Oper. Res. Lett.
Gérard Cornuéjols, David Hartvigsen, William R. Pulleyblank
1982 J jnl
Some facets of the simple plant location polytope.
Math. Program.
Gérard Cornuéjols, Jean-Michel Thizy
1980 J jnl
A Canonical Representation of Simple Plant Location Problems and Its Applications.
SIAM J. Algebraic Discret. Methods
Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey
1980 J jnl
A matching problem with side conditions.
Discret. Math.
Gérard Cornuéjols, William R. Pulleyblank
1980 J jnl
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem.
Oper. Res.
Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey
1978 J jnl
Tight bounds for christofides' traveling salesman heuristic.
Math. Program.
Gérard Cornuéjols, George L. Nemhauser