Gérard Cornuéjols

According to our database1, Gérard Cornuéjols authored at least 131 papers between 1978 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
On the Rational Polytopes with Chvátal Rank 1.
Math. Program., 2020

Cuboids, a class of clutters.
J. Comb. Theory, Ser. B, 2020

Idealness of k-wise Intersecting Families.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019
Idealness and 2-resistant sets.
Oper. Res. Lett., 2019

Identically Self-blocking Clutters.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
When the Gomory-Chvátal closure coincides with the integer hull.
Oper. Res. Lett., 2018

On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank.
Math. Program., 2018

Ideal Clutters That Do Not Pack.
Math. Oper. Res., 2018

2017
From estimation to optimization via shrinkage.
Oper. Res. Lett., 2017

Optimality certificates for convex minimization and Helly numbers.
Oper. Res. Lett., 2017

2016
Cut-Generating Functions for Integer Variables.
Math. Oper. Res., 2016

Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015
Disjunctive cuts for cross-sections of the second-order cone.
Oper. Res. Lett., 2015

Sufficiency of cut-generating functions.
Math. Program., 2015

Special issue of Mathematical Programming, Series B, dedicated to the international symposium on mathematical programming, Pittsburgh, July 2015.
Math. Program., 2015

On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs.
Math. Program., 2015

Cut-Generating Functions and <i>S</i>-Free Sets.
Math. Oper. Res., 2015

2013
Lifting Gomory cuts with bounded variables.
Oper. Res. Lett., 2013

Cutting planes from two-term disjunctions.
Oper. Res. Lett., 2013

On the safety of Gomory cut generators.
Math. Program. Comput., 2013

A 3-Slope Theorem for the infinite relaxation in the plane.
Math. Program., 2013

Unique lifting of integer variables in minimal inequalities.
Math. Program., 2013

Combining Lift-and-Project and Reduce-and-Split.
INFORMS J. Comput., 2013

Extended formulations in combinatorial optimization.
Annals OR, 2013

Cut-Generating Functions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012
A counterexample to a conjecture of Gomory and Johnson.
Math. Program., 2012

Intersection Cuts with Infinite Split Rank.
Math. Oper. Res., 2012

Unique Minimal Liftings for Simplicial Polytopes.
Math. Oper. Res., 2012

How tight is the corner relaxation? Insights gained from the stable set problem.
Discret. Optim., 2012

Mixed-integer nonlinear programs featuring "on/off" constraints.
Comput. Optim. Appl., 2012

2011
Branching on Split Disjunctions.
Proceedings of the Combinatorial Optimization - Methods and Applications, 2011

Practical strategies for generating rank-1 split cuts in mixed-integer linear programming.
Math. Program. Comput., 2011

Branching on general disjunctions.
Math. Program., 2011

Improved strategies for branching on general disjunctions.
Math. Program., 2011

On the relative strength of split, triangle and quadrilateral cuts.
Math. Program., 2011

A Geometric Perspective on Lifting.
Oper. Res., 2011

Experiments with Two-Row Cuts from Degenerate Tableaux.
INFORMS J. Comput., 2011

A Probabilistic Analysis of the Strength of the Split and Triangle Closures.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Minimal Inequalities for an Infinite Relaxation of Integer Programs.
SIAM J. Discret. Math., 2010

Equivalence between intersection cuts and the corner polyhedron.
Oper. Res. Lett., 2010

Maximal Lattice-Free Convex Sets in Linear Subspaces.
Math. Oper. Res., 2010

Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications.
Electron. Notes Discret. Math., 2010

On Lifting Integer Variables in Minimal Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Polyhedral Approaches to Mixed Integer Linear Programming.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009
Stable sets, corner polyhedra and the Chvátal closure.
Oper. Res. Lett., 2009

On the facets of mixed integer programs with two integer variables and two constraints.
Math. Program., 2009

A Feasibility Pump for mixed integer nonlinear programs.
Math. Program., 2009

Minimal Valid Inequalities for Integer Constraints.
Math. Oper. Res., 2009

Lehman matrices.
J. Comb. Theory, Ser. B, 2009

The Chvátal closure of generalized stable sets in bidirected graphs.
Electron. Notes Discret. Math., 2009

2008
Review of combinatorial optimization: packing and covering.
SIGACT News, 2008

A note on the MIR closure.
Oper. Res. Lett., 2008

Valid inequalities for mixed integer linear programs.
Math. Program., 2008

Projected Chvátal-Gomory cuts for mixed integer linear programs.
Math. Program., 2008

An algorithmic framework for convex mixed integer nonlinear programs.
Discret. Optim., 2008

2007
Revival of the Gomory cuts in the 1990's.
Annals OR, 2007

2006
Odd Hole Recognition in Graphs of Bounded Clique Size.
SIAM J. Discret. Math., 2006

A convex-analysis perspective on disjunctive cuts.
Math. Program., 2006

Early Estimates of the Size of Branch-and-Bound Trees.
INFORMS J. Comput., 2006

Balanced matrices.
Discret. Math., 2006

Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements.
Comb., 2006

2005
Split closure and intersection cuts.
Math. Program., 2005

Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts.
Manag. Sci., 2005

Recognizing Berge Graphs.
Comb., 2005

2004
Square-free perfect graphs.
J. Comb. Theory, Ser. B, 2004

Decomposition of odd-hole-free graphs by double star cutsets and 2-joins.
Discret. Appl. Math., 2004

Bicolorings and Equitable Bicolorings of Matrices.
Proceedings of the Sharpest Cut, 2004

2003
Integer programming.
Math. Program., 2003

A class of perfect graphs containing <i>P</i><sub>6</sub>.
J. Comb. Theory, Ser. B, 2003

Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs.
J. Comb. Theory, Ser. B, 2003

K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau.
INFORMS J. Comput., 2003

A Polynomial Algorithm for Recognizing Perfect Graphs.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour.
SIAM J. Discret. Math., 2002

On the rank of mixed 0, 1 polyhedra.
Math. Program., 2002

A connection between cutting plane theory and the geometry of numbers.
Math. Program., 2002

Even-hole-free graphs part I: Decomposition theorem.
Journal of Graph Theory, 2002

Even-hole-free graphs part II: Recognition algorithm.
Journal of Graph Theory, 2002

On dijoins.
Discret. Math., 2002

Ideal clutters.
Discret. Appl. Math., 2002

Perfect Graphs, Partitionable Graphs and Cutsets.
Comb., 2002

2001
Elementary closures for integer programs.
Oper. Res. Lett., 2001

Balanced 0-1 Matrices II. Recognition Algorithm.
J. Comb. Theory, Ser. B, 2001

Balanced 0-1 Matrices I. Decomposition.
J. Comb. Theory, Ser. B, 2001

Perfect, ideal and balanced matrices.
Eur. J. Oper. Res., 2001

2000
On Padberg's conjecture about almost totally unimodular matrices.
Oper. Res. Lett., 2000

The packing property.
Math. Program., 2000

Triangle-free graphs that are signable without even holes.
Journal of Graph Theory, 2000

1999
Even and odd holes in cap-free graphs.
Journal of Graph Theory, 1999

Decomposition of Balanced Matrices.
J. Comb. Theory, Ser. B, 1999

A Class of Hard Small 0-1 Programs.
INFORMS J. Comput., 1999

Balanced cycles and holes in bipartite graphs.
Discret. Math., 1999

1998
Foreword.
Discret. Appl. Math., 1998

1997
Universally Signable Graphs.
Comb., 1997

Finding an Even Hole in a Graph.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Decomposition of Integer Programs and of Generating Sets.
Proceedings of the Algorithms, 1997

1996
Gomory cuts revisited.
Oper. Res. Lett., 1996

Perfect Matchings in Balanced Hypergraphs.
Comb., 1996

1995
Balanced 0, +-1-matrixces, bicoloring and total dual integrality.
Math. Program., 1995

A Class of Logic Problems Solvable by Linear Programming.
J. ACM, 1995

Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs.
Discret. Appl. Math., 1995

A Mickey-Mouse Decomposition Theorem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Combining and Strengthening Gomory Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes.
Math. Oper. Res., 1994

Ideal 0, 1 Matrices.
J. Comb. Theory, Ser. B, 1994

Recognizing Balanced 0, +/- Matrices.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
Polyhedral study of the capacitated vehicle routing problem.
Math. Program., 1993

A lift-and-project cutting plane algorithm for mixed 0-1 programs.
Math. Program., 1993

Complete Multi-partite Cutsets in Minimal Imperfect Graphs.
J. Comb. Theory, Ser. B, 1993

Solving Mixed 0-1 Programs by a Lift-and-Project Method.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Polyhedral methods for the maximum clique problem.
Proceedings of the Cliques, 1993

1990
A Projection Method for the Uncapacitated Facility Location Problem.
Math. Program., 1990

A Decomposition Theorem for Balanced Matrices.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989
On the 0, 1 facets of the set covering polytope.
Math. Program., 1989

1988
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs.
Math. Program., 1988

Probabilistic Analysis of a Relaxation for the <i>k</i>-Median Problem.
Math. Oper. Res., 1988

General factors of graphs.
J. Comb. Theory, Ser. B, 1988

1987
An algorithmic framework for the matching problem in some hypergraphs.
Networks, 1987

1986
Two algorithms for weighted matroid intersection.
Math. Program., 1986

An extension of matching theory.
J. Comb. Theory, Ser. B, 1986

1985
The Traveling Salesman Problem in Graphs with 3-Edge Cutsets
J. ACM, April, 1985

The traveling salesman problem on a graph and some related integer polyhedra.
Math. Program., 1985

Compositions for perfect graphs.
Discret. Math., 1985

1984
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem.
Discret. Appl. Math., 1984

1983
Halin graphs and the travelling salesman problem.
Math. Program., 1983

Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem.
Comb., 1983

1982
Packing subgraphs in a graph.
Oper. Res. Lett., 1982

Some facets of the simple plant location polytope.
Math. Program., 1982

1980
A Canonical Representation of Simple Plant Location Problems and Its Applications.
SIAM J. Matrix Anal. Appl., 1980

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem.
Oper. Res., 1980

A matching problem with side conditions.
Discret. Math., 1980

1978
Tight bounds for christofides' traveling salesman heuristic.
Math. Program., 1978


  Loading...