| Integer programming models M Conforti, G Cornuéjols, G Zambelli, M Conforti, G Cornuéjols, ... Integer Programming, 45-84, 2014 | 1083 | 2014 |
| Extended formulations in combinatorial optimization M Conforti, G Cornuéjols, G Zambelli 4OR 8 (1), 1-48, 2010 | 137 | 2010 |
| Maximal lattice-free convex sets in linear subspaces A Basu, M Conforti, G Cornuéjols, G Zambelli Mathematics of Operations Research 35 (3), 704-720, 2010 | 106 | 2010 |
| Corner polyhedron and intersection cuts M Conforti, G Cornuéjols, G Zambelli Surveys in operations research and management science 16 (2), 105-120, 2011 | 90 | 2011 |
| Extended formulations in combinatorial optimization M Conforti, G Cornuéjols, G Zambelli Annals of Operations Research 204 (1), 97-143, 2013 | 82 | 2013 |
| Minimal inequalities for an infinite relaxation of integer programs A Basu, M Conforti, G Cornuéjols, G Zambelli SIAM Journal on Discrete Mathematics 24 (1), 158-168, 2010 | 76 | 2010 |
| A geometric perspective on lifting M Conforti, G Cornuéjols, G Zambelli Operations Research 59 (3), 569-577, 2011 | 63 | 2011 |
| Polyhedral approaches to mixed integer linear programming M Conforti, G Cornuéjols, G Zambelli 50 Years of Integer Programming 1958-2008: From the Early Years to the State …, 2009 | 49 | 2009 |
| On degenerate multi-row Gomory cuts G Zambelli Operations Research Letters 37 (1), 21-22, 2009 | 42 | 2009 |
| Unique lifting of integer variables in minimal inequalities A Basu, M Campêlo, M Conforti, G Cornuéjols, G Zambelli Mathematical Programming 141, 561-576, 2013 | 35 | 2013 |
| A counterexample to a conjecture of Gomory and Johnson A Basu, M Conforti, G Cornuéjols, G Zambelli Mathematical programming 133 (1), 25-38, 2012 | 35 | 2012 |
| Equivalence between intersection cuts and the corner polyhedron M Conforti, G Cornuéjols, G Zambelli Operations Research Letters 38 (3), 153-155, 2010 | 30 | 2010 |
| Convex sets and minimal sublinear functions A Basu, G Cornuéjols, G Zambelli arXiv preprint arXiv:1701.06550, 2017 | 29 | 2017 |
| Geometric rescaling algorithms for submodular function minimization D Dadush, LA Végh, G Zambelli Mathematics of Operations Research 46 (3), 1081-1108, 2021 | 26 | 2021 |
| Odd hole recognition in graphs of bounded clique size M Conforti, G Cornuéjols, X Liu, K Vuskovic, G Zambelli SIAM Journal on Discrete Mathematics 20 (1), 42-48, 2006 | 25 | 2006 |
| A polynomial recognition algorithm for balanced matrices G Zambelli Journal of Combinatorial Theory, Series B 95 (1), 49-67, 2005 | 23 | 2005 |
| Rescaling algorithms for linear conic feasibility D Dadush, LA Végh, G Zambelli Mathematics of Operations Research 45 (2), 732-754, 2020 | 16 | 2020 |
| Cutting planes from two-term disjunctions P Bonami, M Conforti, G Cornuéjols, M Molinaro, G Zambelli Operations Research Letters 41 (5), 442-444, 2013 | 16 | 2013 |
| On lifting integer variables in minimal inequalities A Basu, M Campelo, M Conforti, G Cornuéjols, G Zambelli Integer Programming and Combinatorial Optimization: 14th International …, 2010 | 16 | 2010 |
| Minimally infeasible set-partitioning problems with balanced constraints M Conforti, MD Summa, G Zambelli Mathematics of Operations Research 32 (3), 497-507, 2007 | 14 | 2007 |
gerard cornuejolsProfessor of Operations Research在 andrew.cmu.edu 的电子邮件经过验证
