| Tighter approximated MILP formulations for unit commitment problems A Frangioni, C Gentile, F Lacalandra IEEE Transactions on Power Systems 24 (1), 105-113, 2008 | 344 | 2008 |
| Perspective cuts for a class of convex 0–1 mixed integer programs A Frangioni, C Gentile Mathematical Programming 106, 225-236, 2006 | 344 | 2006 |
| Solving nonlinear single-unit commitment problems with ramping constraints A Frangioni, C Gentile Operations Research 54 (4), 767-775, 2006 | 157 | 2006 |
| SDP diagonalizations and perspective cuts for a class of nonseparable MIQP A Frangioni, C Gentile Operations Research Letters 35 (2), 181-185, 2007 | 121 | 2007 |
| Tight MIP formulations of the power-based unit commitment problem G Morales-España, C Gentile, A Ramos OR spectrum 37 (4), 929-950, 2015 | 120 | 2015 |
| Solving unit commitment problems with general ramp constraints A Frangioni, C Gentile, F Lacalandra International Journal of Electrical Power & Energy Systems 30 (5), 316-326, 2008 | 112 | 2008 |
| A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints C Gentile, G Morales-Espana, A Ramos EURO Journal on Computational Optimization 5 (1), 177-201, 2017 | 108 | 2017 |
| A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes A Frangioni, C Gentile Operations Research Letters 37 (3), 206-210, 2009 | 105 | 2009 |
| Sequential Lagrangian-MILP approaches for unit commitment problems A Frangioni, C Gentile, F Lacalandra International Journal of Electrical Power & Energy Systems 33 (3), 585-593, 2011 | 83 | 2011 |
| A polyhedral approach for the staff rostering problem G Felici, C Gentile Management Science 50 (3), 381-393, 2004 | 67 | 2004 |
| Projected perspective reformulations with applications in design problems A Frangioni, C Gentile, E Grande, A Pacifici Operations research 59 (5), 1225-1232, 2011 | 53 | 2011 |
| Approximated perspective relaxations: a project and lift approach A Frangioni, F Furini, C Gentile Computational Optimization and Applications 63, 705-735, 2016 | 49 | 2016 |
| Max Horn SAT and the minimum cut problem in directed hypergraphs G Gallo, C Gentile, D Pretolani, G Rago Mathematical Programming 80, 213-237, 1998 | 47 | 1998 |
| New preconditioners for KKT systems of network flow problems A Frangioni, C Gentile SIAM Journal on Optimization 14 (3), 894-913, 2004 | 36 | 2004 |
| Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs A Frangioni, C Gentile, J Hungerford Mathematics of Operations Research 45 (1), 15-33, 2020 | 29 | 2020 |
| Mathematical programming formulations for the alternating current optimal power flow problem D Bienstock, M Escobar, C Gentile, L Liberti 4OR 18 (3), 249-292, 2020 | 26 | 2020 |
| Gear composition and the stable set polytope A Galluccio, C Gentile, P Ventura Operations Research Letters 36 (4), 419-423, 2008 | 26 | 2008 |
| Perspective Reformulations of the CTA Problem with L2 Distances J Castro, A Frangioni, C Gentile Operations Research 62 (4), 891-909, 2014 | 22 | 2014 |
| Improving the approximated projected perspective reformulation by dual information A Frangioni, F Furini, C Gentile Operations Research Letters 45 (5), 519-524, 2017 | 19 | 2017 |
| New MINLP formulations for the unit commitment problems with ramping constraints T Bacci, A Frangioni, C Gentile, K Tavlaridis-Gyparakis Optimization, 2019 | 18 | 2019 |
