Gérard Cornuéjols | Academic Influence

Gérard Cornuéjols's AcademicInfluence.com Rankings

Gérard Cornuéjols

Mathematics

#1197

World Rank

#2005

Historical Rank

Measure Theory

#1606

World Rank

#1985

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Gérard Cornuéjols's Degrees

PhD Mathematics Université Paris Cité

Why Is Gérard Cornuéjols Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Gérard Pierre Cornuéjols is the IBM University Professor of Operations Research in the Carnegie Mellon University Tepper School of Business. His research interests include facility location, integer programming, balanced matrices, and perfect graphs.

(See a Problem?)

Gérard Cornuéjols's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

An algorithmic framework for convex mixed integer nonlinear programs (2008) (913)
A lift-and-project cutting plane algorithm for mixed 0–1 programs (1993) (842)
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (1977) (760)
The uncapacitated facility location problem (1990) (560)
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem (1984) (337)
Recognizing Berge Graphs (2005) (311)
The traveling salesman problem on a graph and some related integer polyhedra (1985) (299)
Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework (1996) (286)
A comparison of heuristics and relaxations for the capacitated plant location problem (1991) (269)
Gomory cuts revisited (1996) (263)
Valid inequalities for mixed integer linear programs (2007) (235)
Combinatorial optimization : packing and covering (2001) (232)
A Feasibility Pump for mixed integer nonlinear programs (2009) (141)
On the Uncapacitated Location Problem (1977) (134)
Minimal Valid Inequalities for Integer Constraints (2009) (131)
Balanced matrices (2006) (126)
Polyhedral study of the capacitated vehicle routing problem (1993) (125)
Halin graphs and the travelling salesman problem (1983) (120)
General factors of graphs (1988) (115)
Maximal Lattice-Free Convex Sets in Linear Subspaces (2010) (113)
Integer programming (2014) (104)
Some facets of the simple plant location polytope (1982) (99)
A Class of Hard Small 0-1 Programs (1998) (96)
Split closure and intersection cuts (2002) (95)
Compositions for perfect graphs (1985) (93)
On the facets of mixed integer programs with two integer variables and two constraints (2008) (91)
Extended formulations in combinatorial optimization (2010) (90)
A matching problem with side conditions (1980) (85)
Optimization Methods in Finance (2018) (83)
Ideal 0, 1 Matrices (1994) (78)
Corner Polyhedron and Intersection Cuts (2011) (75)
Even‐hole‐free graphs part II: Recognition algorithm (2002) (73)
On the 0, 1 facets of the set covering polytope (1989) (72)
Elementary closures for integer programs (2001) (72)
Minimal Inequalities for an Infinite Relaxation of Integer Programs (2010) (72)
Mixed-integer nonlinear programs featuring “on/off” constraints (2012) (71)
Even‐hole‐free graphs part I: Decomposition theorem (2002) (68)
An extension of matching theory (1986) (67)
Polyhedral methods for the maximum clique problem (1994) (65)
On the relative strength of split, triangle and quadrilateral cuts (2009) (65)
Probabilistic Analysis of a Relaxation for the k-Median Problem (1986) (64)
A Geometric Perspective on Lifting (2011) (63)
Decomposition of Balanced Matrices (1999) (63)
Revival of the Gomory cuts in the 1990’s (2007) (59)
Packing subgraphs in a graph (1982) (59)
Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts (2005) (58)
Early Estimates of the Size of Branch-and-Bound Trees (2006) (55)
Polyhedral Approaches to Mixed Integer Linear Programming (2010) (54)
On the Rank of Mixed 0, 1 Polyhedra (2001) (53)
A Canonical Representation of Simple Plant Location Problems and Its Applications (1980) (53)
Even and odd holes in cap-free graphs (1999) (52)
Cut-Generating Functions and S-Free Sets (2015) (52)
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem (1980) (51)
Extended formulations in combinatorial optimization (2013) (49)
Projected Chvátal–Gomory cuts for mixed integer linear programs (2008) (49)
Branching on general disjunctions (2011) (49)
A polynomial algorithm for recognizing perfect graphs (2003) (48)
The packing property (1998) (48)
K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau (2003) (47)
Optimization Methods in Finance by Gerard Cornuejols (2006) (44)
A projection method for the uncapacitated facility location problem (1990) (42)
A convex-analysis perspective on disjunctive cuts (2006) (39)
The traveling salesman problem in graphs with 3-edge cutsets (1985) (39)
Two algorithms for weighted matroid intersection (1986) (39)
Experiments with Two-Row Cuts from Degenerate Tableaux (2011) (38)
A class of logic problems solvable by linear programming (1992) (38)
Decomposition of Integer Programs and of Generating Sets (1997) (37)
Square-free perfect graphs (2004) (36)
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (1983) (36)
Improved strategies for branching on general disjunctions (2011) (34)
The Uncapicitated Facility Location Problem (1983) (33)
Unique lifting of integer variables in minimal inequalities (2013) (33)
A counterexample to a conjecture of Gomory and Johnson (2012) (32)
Balanced 0, ±1-matrices, bicoloring and total dual integrality (1995) (32)
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (2004) (32)
Sufficiency of cut-generating functions (2015) (31)
Equivalence between intersection cuts and the corner polyhedron (2010) (31)
The Strong Perfect Graph Conjecture (2003) (31)
Unique Minimal Liftings for Simplicial Polytopes (2011) (29)
Universally signable graphs (1997) (29)
Even-hole-free graphs part II: Recognition algorithm (2002) (29)
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (1988) (28)
A 3-Slope Theorem for the infinite relaxation in the plane (2013) (26)
Perfect triangle-free 2-matchings (1980) (26)
A Primal Approach To the Simple Plant Location Problem (1982) (26)
Convex Sets and Minimal Sublinear Functions (2010) (25)
Disjunctive cuts for cross-sections of the second-order cone (2015) (25)
Intersection Cuts with Infinite Split Rank (2012) (25)
Even-hole-free graphs part I: Decomposition theorem (2002) (25)
The Travelling Salesman Polytope and {0, 2}-Matchings (1982) (24)
Combining and Strengthening Gomory Cuts (1995) (24)
A Probabilistic Analysis of the Strength of the Split and Triangle Closures (2011) (24)
Ideal Clutters That Do Not Pack (2017) (24)
Perfect, ideal and balanced matrices (2001) (23)
Solving mixed 0-1programs by a lift-and-project method (1993) (23)
Integer Programming Models (2021) (22)
Perfect matchings in balanced hypergraphs (1996) (22)
Balanced 0-1 Matrices I. Decomposition (2001) (20)
A connection between cutting plane theory and the geometry of numbers (2002) (20)
On Lifting Integer Variables in Minimal Inequalities (2010) (20)
On the rank of mixed 0,1 polyhedra (2002) (20)
Odd Hole Recognition in Graphs of Bounded Clique Size (2006) (19)
Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications (2010) (19)
Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour (2002) (18)
Ideal clutters (2002) (18)
Cuboids, a class of clutters (2020) (18)
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs (2003) (17)
Stable sets, corner polyhedra and the Chvátal closure (2009) (15)
Triangle-free graphs that are signable without even holes (2000) (15)
Cut-Generating Functions for Integer Variables (2016) (15)
On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank (2016) (15)
TRAVEL - An interactive travelling salesman problem package for the IBM-personal computer (1987) (15)
Balanced 0-1 Matrices II. Recognition Algorithm (2001) (13)
Complete Multi-partite Cutsets in Minimal Imperfect Graphs (1993) (13)
A Decomposition Theorem for Balanced Matrices (1990) (13)
How tight is the corner relaxation? Insights gained from the stable set problem (2012) (12)
Combinatorial optimization (1987) (11)
On the safety of Gomory cut generators (2013) (10)
A Mickey-Mouse Decomposition Theorem (1995) (10)
Optimality certificates for convex minimization and Helly numbers (2016) (10)
Lehman matrices (2009) (10)
Cutting planes from two-term disjunctions (2013) (10)
Perfect Graphs, Partitionable Graphs and Cutsets (2002) (9)
Cut-Generating Functions (2013) (9)
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (2011) (9)
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (2016) (9)
A Class of Logical Inference Problem Solvable by Linear Programming (1992) (9)
On dijoins (2002) (9)
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs (2015) (8)
Perfect 0, ± 1 matrices☆ (1997) (8)
The Strong Perfect Graph Theorem (2003) (8)
Quantitative Methods for the Management Sciences 45-760 Course Notes Contents 0.1 Introduction 2 Unconstrained Optimization: Functions of One Variable 25 2.1 Derivatives 3 Unconstrained Optimization: Functions of Several Variables 37 3.1 Gradient 4 Constrained Optimization 43 4.1 Equality Constraint (1998) (7)
Decomposing Berge Graphs Containing Proper Wheels (2002) (7)
On Padberg's conjecture about almost totally unimodular matrices (2000) (7)
From estimation to optimization via shrinkage (2017) (7)
Intersecting Restrictions in Clutters (2020) (7)
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes (1994) (7)
The Ongoing Story of Gomory Cuts (2012) (6)
Resistant Sets in the Unit Hypercube (2019) (6)
Clean Clutters and Dyadic Fractional Packings (2022) (5)
When the Gomory-Chvátal closure coincides with the integer hull (2018) (5)
On the Rational Polytopes with Chvátal Rank 1 (2018) (5)
Balanced cycles and holes in bipartite graphs (1999) (5)
Optimization Methods in Finance: Stochastic programming models: Value-at-Risk and Conditional Value-at-Risk (2006) (5)
Combining Lift-and-Project and Reduce-and-Split (2013) (5)
Identically Self-blocking Clutters (2019) (5)
Lifting Gomory cuts with bounded variables (2013) (4)
A note on the MIR closure (2008) (4)
An algorithmic framework for the matching problem in some hypergraphs (1987) (4)
ON THE WEAK MAX FLOW MIN CUT PROPERTY (1989) (4)
Supply Contracts Under Bounded Order Quantities (1992) (4)
Recognizing balanced 0,±matrices (1994) (3)
The max-flow min-cut property and ±1-resistant sets (2021) (3)
Linear Inequalities and Polyhedra (2014) (3)
A new infinite class of ideal minimally non-packing clutters (2021) (3)
Idealness and 2-resistant sets (2019) (2)
Integer Programming and Combinatorial Optimization (1999) (2)
On Dyadic Fractional Packings of $T$-Joins (2022) (2)
Optimization Methods in Finance: DP models: structuring asset-backed securities (2006) (2)
Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs (1995) (1)
Maximal Lattice-free Convex sets in 3 Dimensions (2009) (1)
Sufficiency of cut-generating functions (2014) (1)
Reformulations and Relaxations (2014) (1)
Valid Inequalities for Structured Integer Programs (2014) (1)
Review of combinatorial optimization: packing and covering (2008) (1)
Correction to: Idealness of k-wise intersecting families (2022) (1)
A class of perfect graphs containing P6 (2003) (1)
Decomposition of Balanced Matrices. Part 1. Introduction (1991) (1)
Optimization Methods in Finance: Dynamic programming methods (2006) (1)
Computational Aspects of Bayesian Solution Estimators in Stochastic Optimization (2020) (1)
Bicolorings and Equitable Bicolorings of Matrices (2004) (1)
Optimization Methods in Finance: Conic optimization tools (2006) (1)
Special issue of Mathematical Programming, Series B, dedicated to the international symposium on mathematical programming, Pittsburgh, July 2015 (2015) (1)
Degree Sequences of Random Graphs. (1979) (1)
Optimization Methods in Finance: Robust optimization: theory and tools (2006) (0)
Branching on Split Disjunctions (2011) (0)
Optimization Methods in Finance: LP models: asset/liability cash-flow matching (2006) (0)
Intersecting Restrictions in Clutters (2020) (0)
Facts and Questions toward the bounded perfect graph conjectures (2006) (0)
Optimization Methods in Finance: Linear programming: theory and algorithms (2006) (0)
Cut-Generating Functions for Integer Variables Sercan Yıldız and (2015) (0)
Balanced 0, + or - Matrices. Part 2. Recognition Algorithm (1994) (0)
10. Decomposition of Perfect Graphs (2001) (0)
Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem (1983) (0)
Optimization Methods in Finance: The revised simplex method (2006) (0)
Optimization Methods in Finance: Introduction (2006) (0)
2. T-Cuts and T-Joins (2001) (0)
Balanced 0, + or - Matrices. Part 1. Decomposition, (1994) (0)
Optimization Methods in Finance: Robust optimization models in finance (2006) (0)
On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank (2018) (0)
Conic optimization models in finance (2006) (0)
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992 (1992) (0)
Intersection Cuts and Corner Polyhedra (2014) (0)
Optimization Methods in Finance: Stochastic programming models: asset/liability management (2006) (0)
Optimization Methods in Finance: QP models: portfolio optimization (2006) (0)
Every Nontrivial Facet-Defining Inequality for the Corner Polyhedron is an Intersection Cut (2009) (0)
Optimization Methods in Finance: Quadratic programming: theory and algorithms (2006) (0)
Tepper School of Business 5-1999 The Packing Property (2015) (0)
Optimization Methods in Finance: Integer programming models: constructing an index fund (2006) (0)
Decomposition of Balanced Matrices. Part 4. Connected Squares (1991) (0)
Extended formulations in combinatorial optimization (2013) (0)
Optimization Methods in Finance: Nonlinear programming: theory and algorithms (2006) (0)
The Chvátal closure of generalized stable sets in bidirected graphs (2009) (0)
Optimization Methods in Finance: Stochastic programming: theory and algorithms (2006) (0)
6. 0,±1 Matrices and Integral Polyhedra (2001) (0)
Decomposition of Balanced Matrices. Part 5: Goggles (1991) (0)
4. Ideal Matrices (2001) (0)
Decomposition of Balanced Matrices. Part 2. Wheel-and-Parachute-Free Graphs (1991) (0)
7. Signing 0,1 Matrices to Be Totally Unimodular or Balanced (2001) (0)
5. Odd Cycles in Graphs (2001) (0)
Balanced 0, \1 Matrices I. Decomposition 1 (2001) (0)
Decomposition of Balanced Matrices. Part 6. Even Wheels (1991) (0)
APPLICATION TO THE EFFICIENT SOLUTION OF TWO OPTIMIZATION PROBLEMS ON GRAPHS by (0)
Branching on General Disjunctions 1 (2007) (0)
: Pioneer in Integer Programming ( June 7 , 1922-March 18 , 2019 ) by (2019) (0)
Integer Programming and Combinatorial Optimization (2001) (0)
Aclass of perfect graphs containing P 6 (2003) (0)
Quadratic Programming Models: Mean–Variance Optimization (2018) (0)
Optimization in the Medical Applications of Discrete Tomography (2006) (0)
Modeling Stock Returns as Mixtures of Normals and Incorporating Black-Litterman Views in Portfolio Optimization (2017) (0)
A 3-Slope Theorem for the infinite relaxation in the plane (2012) (0)
Mixed Integer Programming Models: Portfolios with Combinatorial Constraints (2018) (0)
Foreword (1998) (0)
School of Business 12-2000 A Note on Dijoins (2015) (0)
Covering, Packing and Logical Inference (1993) (0)
dra ft Projective geometries , simplices and clutters (2019) (0)
How tight is the corner relaxation? (2011) (0)
Tepper School of Business 10-2000 Elementary Closures for Integer Programs (2015) (0)
Optimization Methods in Finance: DP models: option pricing (2006) (0)
3. Perfect Graphs and Matrices (2001) (0)
Split and Gomory Inequalities (2014) (0)
A counterexample to a conjecture of Gomory and Johnson (2010) (0)
On the Rational Polytopes with Chvátal Rank 1 (2018) (0)
On Families of Split Cuts that Can Be Generated Efficiently (2009) (0)
Decomposition of Balanced Matrices. Part 7. A Polynomial Recognition Algorithm (1991) (0)
Testing idealness in the ﬁlter oracle model (2022) (0)
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs (2014) (0)
Mixed Integer Programming: Theory and Algorithms (2018) (0)
Optimization Methods in Finance: Foreword (2006) (0)
NLP models: volatility estimation (2006) (0)
Integer programming: theory and algorithms (2006) (0)
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization (1999) (0)
Decomposition of Balanced Matrices. Part 3. Parachutes (1991) (0)
Mathematical Programming and Logical Inference (1990) (0)
Optimization Methods in Finance: LP models: asset pricing and arbitrage (2006) (0)
Special issue of Mathematical Programming, Series B, dedicated to the international symposium on mathematical programming, Pittsburgh, July 2015 (2015) (0)
Tepper School of Business 3-2009 Convex Sets and Minimal Sublinear Functions (2015) (0)
Portfolio optimization in the presence of estimation errors on the expected asset returns (2022) (0)
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements (2006) (0)
School of Business 5-2012 On the safety of Gomory cut generators (2015) (0)
8. Decomposition by k-Sum (2001) (0)

This paper list is powered by the following services:

Other Resources About Gérard Cornuéjols

en.wikipedia.org

What Schools Are Affiliated With Gérard Cornuéjols?

Gérard Cornuéjols is affiliated with the following schools:

Image Attributions

Image Source for Gérard Cornuéjols