default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGérard Cornuéjols
Person information
- award (2015): Frederick W. Lanchester Prize
- award (2011): John von Neumann Theory Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j130]Ahmad Abdi
, Gérard Cornuéjols, Giacomo Zambelli:
Arc Connectivity and Submodular Flows in Digraphs. Comb. 44(5): 1069-1090 (2024)- [j129]Ahmad Abdi, Gérard Cornuéjols, Giacomo Zambelli:
Erratum to: Arc Connectivity and Submodular Flows in Digraphs. Comb. 44(6): 1403 (2024) - [j128]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Total dual dyadicness and dyadic generating sets. Math. Program. 206(1): 125-143 (2024) - [j127]Gérard Cornuéjols, Vrishabh Patil:
Reducing the Chvátal rank through binarization. Oper. Res. Lett. 54: 107119 (2024) - [c26]Gérard Cornuéjols, Siyue Liu, R. Ravi:
Approximately Packing Dijoins via Nowhere-Zero Flows. IPCO 2024: 71-84 - 2023
- [j126]Ahmad Abdi, Gérard Cornuéjols, Michael Zlatin:
On Packing Dijoins in Digraphs and Weighted Digraphs. SIAM J. Discret. Math. 37(4): 2417-2461 (2023) - [i2]Gérard Cornuéjols, Yatharth Dubey:
Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization. CoRR abs/2311.00185 (2023) - 2022
- [j125]Ahmad Abdi, Gérard Cornuéjols, Matt Superdock:
Clean tangled clutters, simplices, and projective geometries. J. Comb. Theory B 154: 60-92 (2022) - [j124]Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Idealness of k-wise intersecting families. Math. Program. 192(1): 29-50 (2022) - [j123]Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Correction to: Idealness of k-wise intersecting families. Math. Program. 192(1): 51-55 (2022) - [j122]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Testing idealness in the filter oracle model. Oper. Res. Lett. 50(6): 753-755 (2022) - [j121]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Clean Clutters and Dyadic Fractional Packings. SIAM J. Discret. Math. 36(2): 1012-1037 (2022) - [j120]Ahmad Abdi, Gérard Cornuéjols, Zuzanna Palion:
On Dyadic Fractional Packings of $T$-Joins. SIAM J. Discret. Math. 36(3): 2445-2451 (2022) - [c25]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Total Dual Dyadicness and Dyadic Generating Sets. IPCO 2022: 1-14 - 2021
- [j119]Ahmad Abdi, Gérard Cornuéjols:
The max-flow min-cut property and ±1-resistant sets. Discret. Appl. Math. 289: 455-476 (2021) - [j118]Ahmad Abdi, Gérard Cornuéjols, Matt Superdock:
A new infinite class of ideal minimally non-packing clutters. Discret. Math. 344(7): 112413 (2021) - [j117]Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee:
Resistant Sets in the Unit Hypercube. Math. Oper. Res. 46(1): 82-114 (2021) - 2020
- [j116]Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee:
Intersecting Restrictions in Clutters. Comb. 40(5): 605-623 (2020) - [j115]Danial Davarnia, Burak Kocuk, Gérard Cornuéjols:
Computational Aspects of Bayesian Solution Estimators in Stochastic Optimization. INFORMS J. Optim. 2(4): 256-272 (2020) - [j114]Ahmad Abdi, Gérard Cornuéjols, Natália Guricanová, Dabeen Lee:
Cuboids, a class of clutters. J. Comb. Theory B 142: 144-209 (2020) - [j113]Gérard Cornuéjols, Dabeen Lee, Yanjun Li:
On the Rational Polytopes with Chvátal Rank 1. Math. Program. 179(1): 21-46 (2020) - [c24]Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Idealness of k-wise Intersecting Families. IPCO 2020: 1-12
2010 – 2019
- 2019
- [j112]Ahmad Abdi, Gérard Cornuéjols:
Idealness and 2-resistant sets. Oper. Res. Lett. 47(5): 358-362 (2019) - [c23]Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee:
Identically Self-blocking Clutters. IPCO 2019: 1-12 - [i1]Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Idealness of k-wise intersecting families. CoRR abs/1912.00614 (2019) - 2018
- [j111]Ahmad Abdi, Kanstantsin Pashkovich, Gérard Cornuéjols:
Ideal Clutters That Do Not Pack. Math. Oper. Res. 43(2): 533-553 (2018) - [j110]Gérard Cornuéjols, Dabeen Lee:
On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank. Math. Program. 172(1-2): 467-503 (2018) - [j109]Gérard Cornuéjols, Yanjun Li:
When the Gomory-Chvátal closure coincides with the integer hull. Oper. Res. Lett. 46(2): 251-256 (2018) - 2017
- [j108]Danial Davarnia, Gérard Cornuéjols:
From estimation to optimization via shrinkage. Oper. Res. Lett. 45(6): 642-646 (2017) - [j107]Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Robert Weismantel, Stefan Weltge:
Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. 45(6): 671-674 (2017) - 2016
- [j106]Sercan Yildiz, Gérard Cornuéjols:
Cut-Generating Functions for Integer Variables. Math. Oper. Res. 41(4): 1381-1403 (2016) - [c22]Gérard Cornuéjols, Dabeen Lee:
On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal Rank. IPCO 2016: 300-311 - [c21]Gérard Cornuéjols, Yanjun Li:
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point. IPCO 2016: 387-397 - 2015
- [j105]Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick:
Cut-Generating Functions and S-Free Sets. Math. Oper. Res. 40(2): 276-391 (2015) - [j104]Yogesh Awate, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. Math. Program. 150(2): 459-489 (2015) - [j103]Gérard Cornuéjols, Andrew J. Schaefer:
Special issue of Mathematical Programming, Series B, dedicated to the international symposium on mathematical programming, Pittsburgh, July 2015. Math. Program. 151(1): 1-2 (2015) - [j102]Gérard Cornuéjols, Laurence A. Wolsey, Sercan Yildiz:
Sufficiency of cut-generating functions. Math. Program. 152(1-2): 643-651 (2015) - [j101]Sercan Yildiz, Gérard Cornuéjols:
Disjunctive cuts for cross-sections of the second-order cone. Oper. Res. Lett. 43(4): 432-437 (2015) - 2013
- [j100]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Extended formulations in combinatorial optimization. Ann. Oper. Res. 204(1): 97-143 (2013) - [j99]Egon Balas, Gérard Cornuéjols, Tamás Kis, Giacomo Nannicini:
Combining Lift-and-Project and Reduce-and-Split. INFORMS J. Comput. 25(3): 475-487 (2013) - [j98]Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Unique lifting of integer variables in minimal inequalities. Math. Program. 141(1-2): 561-576 (2013) - [j97]Gérard Cornuéjols, Marco Molinaro:
A 3-Slope Theorem for the infinite relaxation in the plane. Math. Program. 142(1-2): 83-105 (2013) - [j96]Gérard Cornuéjols, François Margot, Giacomo Nannicini:
On the safety of Gomory cut generators. Math. Program. Comput. 5(4): 345-395 (2013) - [j95]Gérard Cornuéjols, Tamás Kis, Marco Molinaro:
Lifting Gomory cuts with bounded variables. Oper. Res. Lett. 41(2): 142-146 (2013) - [j94]Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli:
Cutting planes from two-term disjunctions. Oper. Res. Lett. 41(5): 442-444 (2013) - [c20]Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick:
Cut-Generating Functions. IPCO 2013: 123-132 - 2012
- [j93]Hassan L. Hijazi, Pierre Bonami, Gérard Cornuéjols, Adam Ouorou:
Mixed-integer nonlinear programs featuring "on/off" constraints. Comput. Optim. Appl. 52(2): 537-558 (2012) - [j92]Gérard Cornuéjols, Carla Michini, Giacomo Nannicini:
How tight is the corner relaxation? Insights gained from the stable set problem. Discret. Optim. 9(2): 109-121 (2012) - [j91]Amitabh Basu, Gérard Cornuéjols, François Margot:
Intersection Cuts with Infinite Split Rank. Math. Oper. Res. 37(1): 21-40 (2012) - [j90]Amitabh Basu, Gérard Cornuéjols, Matthias Köppe:
Unique Minimal Liftings for Simplicial Polytopes. Math. Oper. Res. 37(2): 346-355 (2012) - [j89]Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
A counterexample to a conjecture of Gomory and Johnson. Math. Program. 133(1-2): 25-38 (2012) - 2011
- [j88]Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot:
Experiments with Two-Row Cuts from Degenerate Tableaux. INFORMS J. Comput. 23(4): 578-590 (2011) - [j87]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
A Geometric Perspective on Lifting. Oper. Res. 59(3): 569-577 (2011) - [j86]Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot:
On the relative strength of split, triangle and quadrilateral cuts. Math. Program. 126(2): 281-314 (2011) - [j85]Miroslav Karamanov, Gérard Cornuéjols:
Branching on general disjunctions. Math. Program. 128(1-2): 403-436 (2011) - [j84]Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini:
Improved strategies for branching on general disjunctions. Math. Program. 130(2): 225-247 (2011) - [j83]Gérard Cornuéjols, Giacomo Nannicini:
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming. Math. Program. Comput. 3(4): 281-318 (2011) - [c19]Amitabh Basu, Gérard Cornuéjols, Marco Molinaro:
A Probabilistic Analysis of the Strength of the Split and Triangle Closures. IPCO 2011: 27-38 - [p3]Giacomo Nannicini, Gérard Cornuéjols, Miroslav Karamanov, Leo Liberti:
Branching on Split Disjunctions. Combinatorial Optimization - Methods and Applications 2011: 164-182 - 2010
- [j82]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Extended formulations in combinatorial optimization. 4OR 8(1): 1-48 (2010) - [j81]Hassan L. Hijazi, Pierre Bonami, Gérard Cornuéjols, Adam Ouorou:
Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications. Electron. Notes Discret. Math. 36: 1153-1160 (2010) - [j80]Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Maximal Lattice-Free Convex Sets in Linear Subspaces. Math. Oper. Res. 35(3): 704-720 (2010) - [j79]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Equivalence between intersection cuts and the corner polyhedron. Oper. Res. Lett. 38(3): 153-155 (2010) - [j78]Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM J. Discret. Math. 24(1): 158-168 (2010) - [c18]Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
On Lifting Integer Variables in Minimal Inequalities. IPCO 2010: 85-95 - [p2]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Polyhedral Approaches to Mixed Integer Linear Programming. 50 Years of Integer Programming 2010: 343-385
2000 – 2009
- 2009
- [j77]Manoel B. Campêlo, Gérard Cornuéjols:
The Chvátal closure of generalized stable sets in bidirected graphs. Electron. Notes Discret. Math. 35: 89-95 (2009) - [j76]Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Lehman matrices. J. Comb. Theory B 99(3): 531-556 (2009) - [j75]Valentin Borozan, Gérard Cornuéjols:
Minimal Valid Inequalities for Integer Constraints. Math. Oper. Res. 34(3): 538-546 (2009) - [j74]Pierre Bonami, Gérard Cornuéjols, Andrea Lodi, François Margot:
A Feasibility Pump for mixed integer nonlinear programs. Math. Program. 119(2): 331-352 (2009) - [j73]Gérard Cornuéjols, François Margot:
On the facets of mixed integer programs with two integer variables and two constraints. Math. Program. 120(2): 429-456 (2009) - [j72]Manoel B. Campêlo, Gérard Cornuéjols:
Stable sets, corner polyhedra and the Chvátal closure. Oper. Res. Lett. 37(6): 375-378 (2009) - [c17]Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini:
Improved Strategies for Branching on General Disjunctions. CTW 2009: 144-145 - [c16]Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot:
On the relative strength of split, triangle and quadrilateral cuts. SODA 2009: 1220-1229 - 2008
- [j71]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:
An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2): 186-204 (2008) - [j70]Gérard Cornuéjols:
Valid inequalities for mixed integer linear programs. Math. Program. 112(1): 3-44 (2008) - [j69]Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi:
Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Program. 113(2): 241-257 (2008) - [j68]Pierre Bonami, Gérard Cornuéjols:
A note on the MIR closure. Oper. Res. Lett. 36(1): 4-6 (2008) - [j67]Gérard Cornuéjols:
Review of combinatorial optimization: packing and covering. SIGACT News 39(3): 16-18 (2008) - [c15]Gérard Cornuéjols, François Margot:
On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints. LATIN 2008: 317-328 - 2007
- [j66]Gérard Cornuéjols:
Revival of the Gomory cuts in the 1990's. Ann. Oper. Res. 149(1): 63-66 (2007) - 2006
- [j65]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. Comb. 26(5): 533-558 (2006) - [j64]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Balanced matrices. Discret. Math. 306(19-20): 2411-2437 (2006) - [j63]Gérard Cornuéjols, Miroslav Karamanov, Yanjun Li:
Early Estimates of the Size of Branch-and-Bound Trees. INFORMS J. Comput. 18(1): 86-96 (2006) - [j62]Gérard Cornuéjols, Claude Lemaréchal:
A convex-analysis perspective on disjunctive cuts. Math. Program. 106(3): 567-586 (2006) - [j61]Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli:
Odd Hole Recognition in Graphs of Bounded Clique Size. SIAM J. Discret. Math. 20(1): 42-48 (2006) - 2005
- [j60]Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic:
Recognizing Berge Graphs. Comb. 25(2): 143-186 (2005) - [j59]Kent Andersen, Gérard Cornuéjols, Yanjun Li:
Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts. Manag. Sci. 51(11): 1720-1732 (2005) - [j58]Kent Andersen, Gérard Cornuéjols, Yanjun Li:
Split closure and intersection cuts. Math. Program. 102(3): 457-493 (2005) - 2004
- [j57]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. Discret. Appl. Math. 141(1-3): 41-91 (2004) - [j56]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Square-free perfect graphs. J. Comb. Theory B 90(2): 257-307 (2004) - [p1]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Bicolorings and Equitable Bicolorings of Matrices. The Sharpest Cut 2004: 33-37 - 2003
- [j55]Gérard Cornuéjols, Yanjun Li, Dieter Vandenbussche:
K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau. INFORMS J. Comput. 15(4): 385-396 (2003) - [j54]Michele Conforti, Gérard Cornuéjols:
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. J. Comb. Theory B 87(2): 300-330 (2003) - [j53]Gérard Cornuéjols, Xinming Liu:
A class of perfect graphs containing P6. J. Comb. Theory B 87(2): 331-347 (2003) - [j52]Gérard Cornuéjols, William R. Pulleyblank:
Integer programming. Math. Program. 98(1-3): 1-2 (2003) - [c14]Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic:
A Polynomial Algorithm for Recognizing Perfect Graphs. FOCS 2003: 20-27 - 2002
- [j51]Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic:
Perfect Graphs, Partitionable Graphs and Cutsets. Comb. 22(1): 19-33 (2002) - [j50]Gérard Cornuéjols, Bertrand Guenin:
Ideal clutters. Discret. Appl. Math. 123(1-3): 303-338 (2002) - [j49]Gérard Cornuéjols, Bertrand Guenin:
On dijoins. Discret. Math. 243(1-3): 213-216 (2002) - [j48]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even-hole-free graphs part I: Decomposition theorem. J. Graph Theory 39(1): 6-49 (2002) - [j47]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even-hole-free graphs part II: Recognition algorithm. J. Graph Theory 40(4): 238-266 (2002) - [j46]Gérard Cornuéjols, Yanjun Li:
On the rank of mixed 0, 1 polyhedra. Math. Program. 91(2): 391-397 (2002) - [j45]Gérard Cornuéjols, Yanjun Li:
A connection between cutting plane theory and the geometry of numbers. Math. Program. 93(1): 123-127 (2002) - [j44]Gérard Cornuéjols, Bertrand Guenin:
Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. SIAM J. Discret. Math. 15(3): 329-352 (2002) - [c13]Kent Andersen, Gérard Cornuéjols, Yanjun Li:
Split Closure and Intersection Cuts. IPCO 2002: 127-144 - 2001
- [j43]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Perfect, ideal and balanced matrices. Eur. J. Oper. Res. 133(3): 455-461 (2001) - [j42]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Balanced 0-1 Matrices I. Decomposition. J. Comb. Theory B 81(2): 243-274 (2001) - [j41]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Balanced 0-1 Matrices II. Recognition Algorithm. J. Comb. Theory B 81(2): 275-306 (2001) - [j40]Gérard Cornuéjols, Yanjun Li:
Elementary closures for integer programs. Oper. Res. Lett. 28(1): 1-8 (2001) - [c12]Gérard Cornuéjols, Yanjun Li:
On the Rank of Mixed 0, 1 Polyhedra. IPCO 2001: 71-77 - 2000
- [j39]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Triangle-free graphs that are signable without even holes. J. Graph Theory 34(3): 204-220 (2000) - [j38]Gérard Cornuéjols, Bertrand Guenin, François Margot:
The packing property. Math. Program. 89(1): 113-126 (2000) - [j37]Gérard Cornuéjols, Luis Fernando Zuluaga:
On Padberg's conjecture about almost totally unimodular matrices. Oper. Res. Lett. 27(3): 97-99 (2000)
1990 – 1999
- 1999
- [j36]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Balanced cycles and holes in bipartite graphs. Discret. Math. 199(1-3): 27-33 (1999) - [j35]Gérard Cornuéjols, Milind Dawande:
A Class of Hard Small 0-1 Programs. INFORMS J. Comput. 11(2): 205-210 (1999) - [j34]Michele Conforti, Gérard Cornuéjols, M. R. Rao:
Decomposition of Balanced Matrices. J. Comb. Theory B 77(2): 292-406 (1999) - [j33]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even and odd holes in cap-free graphs. J. Graph Theory 30(4): 289-308 (1999) - [e2]Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger:
Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings. Lecture Notes in Computer Science 1610, Springer 1999, ISBN 3-540-66019-4 [contents] - 1998
- [j32]Gérard Cornuéjols, William R. Pulleyblank:
Foreword. Discret. Appl. Math. 89(1-3): 1-2 (1998) - [c11]Gérard Cornuéjols, Bertrand Guenin, François Margot:
The Packing Property. IPCO 1998: 1-8 - [c10]Gérard Cornuéjols, Milind Dawande:
A Class of Hard Small 0-1 Programs. IPCO 1998: 284-293 - 1997
- [j31]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Universally Signable Graphs. Comb. 17(1): 67-77 (1997) - [c9]Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey:
Decomposition of Integer Programs and of Generating Sets. ESA 1997: 92-102 - [c8]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Finding an Even Hole in a Graph. FOCS 1997: 480-485 - 1996
- [j30]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Perfect Matchings in Balanced Hypergraphs. Comb. 16(3): 325-329 (1996) - [j29]Egon Balas, Sebastián Ceria, Gérard Cornuéjols, N. Natraj:
Gomory cuts revisited. Oper. Res. Lett. 19(1): 1-9 (1996) - 1995
- [j28]Michele Conforti, Gérard Cornuéjols, M. R. Rao:
Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. Discret. Appl. Math. 62(1-3): 103-117 (1995) - [j27]Michele Conforti, Gérard Cornuéjols:
A Class of Logic Problems Solvable by Linear Programming. J. ACM 42(5): 1107-1113 (1995) - [j26]Michele Conforti, Gérard Cornuéjols:
Balanced 0, +-1-matrixces, bicoloring and total dual integrality. Math. Program. 71: 249-258 (1995) - [c7]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
A Mickey-Mouse Decomposition Theorem. IPCO 1995: 321-328 - [c6]Sebastián Ceria, Gérard Cornuéjols, Milind Dawande:
Combining and Strengthening Gomory Cuts. IPCO 1995: 438-451 - 1994
- [j25]Gérard Cornuéjols, Beth Novick:
Ideal 0, 1 Matrices. J. Comb. Theory B 60(1): 145-157 (1994) - [j24]Michele Conforti, Gérard Cornuéjols, Klaus Truemper:
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes. Math. Oper. Res. 19(1): 21-23 (1994) - [c5]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Recognizing Balanced 0, +/- Matrices. SODA 1994: 103-111 - 1993
- [j23]Gérard Cornuéjols, Bruce A. Reed:
Complete Multi-partite Cutsets in Minimal Imperfect Graphs. J. Comb. Theory B 59(2): 191-198 (1993) - [j22]Egon Balas, Sebastián Ceria, Gérard Cornuéjols:
A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58: 295-324 (1993) - [j21]Gérard Cornuéjols, Farid Harche:
Polyhedral study of the capacitated vehicle routing problem. Math. Program. 60: 21-52 (1993) - [c4]Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki:
Polyhedral methods for the maximum clique problem. Cliques, Coloring, and Satisfiability 1993: 11-28 - [c3]Egon Balas, Sebastián Ceria, Gérard Cornuéjols:
Solving Mixed 0-1 Programs by a Lift-and-Project Method. SODA 1993: 232-242 - 1992
- [c2]Michele Conforti, Gérard Cornuéjols:
A Class of Logic Problems Solvable by Linear Programming. FOCS 1992: 670-675 - [e1]Egon Balas, Gérard Cornuéjols, Ravi Kannan:
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992. Carnegie Mellon University 1992 [contents] - 1990
- [j20]Andrew R. Conn, Gérard Cornuéjols:
A Projection Method for the Uncapacitated Facility Location Problem. Math. Program. 46: 273-298 (1990) - [c1]Michele Conforti, Gérard Cornuéjols:
A Decomposition Theorem for Balanced Matrices. IPCO 1990: 147-169
1980 – 1989
- 1989
- [j19]Gérard Cornuéjols, Antonio Sassano:
On the 0, 1 facets of the set covering polytope. Math. Program. 43(1-3): 45-55 (1989) - 1988
- [j18]Gérard Cornuéjols:
General factors of graphs. J. Comb. Theory B 45(2): 185-198 (1988) - [j17]Sang Ahn, Colin Cooper, Gérard Cornuéjols, Alan M. Frieze:
Probabilistic Analysis of a Relaxation for the k-Median Problem. Math. Oper. Res. 13(1): 1-31 (1988) - [j16]Carl Brezovec, Gérard Cornuéjols, Fred W. Glover:
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs. Math. Program. 42(1-3): 471-487 (1988) - 1987
- [j15]Michele Conforti, Gérard Cornuéjols:
An algorithmic framework for the matching problem in some hypergraphs. Networks 17(4): 365-386 (1987) - 1986
- [j14]Gérard Cornuéjols, David Hartvigsen:
An extension of matching theory. J. Comb. Theory B 40(3): 285-296 (1986) - [j13]Carl Brezovec, Gérard Cornuéjols, Fred W. Glover:
Two algorithms for weighted matroid intersection. Math. Program. 36(1): 39-53 (1986) - 1985
- [j12]Gérard Cornuéjols, William H. Cunningham:
Compositions for perfect graphs. Discret. Math. 55(3): 245-254 (1985) - [j11]Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank:
The Traveling Salesman Problem in Graphs with 3-Edge Cutsets. J. ACM 32(2): 383-410 (1985) - [j10]Gérard Cornuéjols, Jean Fonlupt, Denis Naddef:
The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33(1): 1-27 (1985) - 1984
- [j9]Michele Conforti, Gérard Cornuéjols:
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discret. Appl. Math. 7(3): 251-274 (1984) - 1983
- [j8]Gérard Cornuéjols, William R. Pulleyblank:
Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem. Comb. 3(1): 35-52 (1983) - [j7]Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank:
Halin graphs and the travelling salesman problem. Math. Program. 26(3): 287-294 (1983) - 1982
- [j6]Gérard Cornuéjols, Jean-Michel Thizy:
Some facets of the simple plant location polytope. Math. Program. 23(1): 50-74 (1982) - [j5]Gérard Cornuéjols, David Hartvigsen, William R. Pulleyblank:
Packing subgraphs in a graph. Oper. Res. Lett. 1(4): 139-143 (1982) - 1980
- [j4]Gérard Cornuéjols, William R. Pulleyblank:
A matching problem with side conditions. Discret. Math. 29(2): 135-159 (1980) - [j3]Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey:
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem. Oper. Res. 28(4): 847-858 (1980) - [j2]Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey:
A Canonical Representation of Simple Plant Location Problems and Its Applications. SIAM J. Algebraic Discret. Methods 1(3): 261-272 (1980)
1970 – 1979
- 1978
- [j1]Gérard Cornuéjols, George L. Nemhauser:
Tight bounds for christofides' traveling salesman heuristic. Math. Program. 14(1): 116-121 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
