Seguir
Claudio Gentile
Claudio Gentile
Istituto di Analisi dei Sistemi ed Informatica "A. Ruberti" ( CNR - IASI )
Email confirmado em iasi.cnr.it - Página inicial
Título
Citado por
Citado por
Ano
Perspective cuts for a class of convex 0–1 mixed integer programs
A Frangioni, C Gentile
Mathematical Programming 106, 225-236, 2006
3422006
Tighter approximated MILP formulations for unit commitment problems
A Frangioni, C Gentile, F Lacalandra
IEEE Transactions on Power Systems 24 (1), 105-113, 2008
3412008
Solving nonlinear single-unit commitment problems with ramping constraints
A Frangioni, C Gentile
Operations Research 54 (4), 767-775, 2006
1572006
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
A Frangioni, C Gentile
Operations Research Letters 35 (2), 181-185, 2007
1172007
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
1152015
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
1132008
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
1012017
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
1012009
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
842011
A polyhedral approach for the staff rostering problem
G Felici, C Gentile
Management Science 50 (3), 381-393, 2004
652004
Projected perspective reformulations with applications in design problems
A Frangioni, C Gentile, E Grande, A Pacifici
Operations research 59 (5), 1225-1232, 2011
512011
Approximated perspective relaxations: a project and lift approach
A Frangioni, F Furini, C Gentile
Computational Optimization and Applications 63, 705-735, 2016
472016
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
471998
New preconditioners for KKT systems of network flow problems
A Frangioni, C Gentile
SIAM Journal on Optimization 14 (3), 894-913, 2004
352004
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
292020
Gear composition and the stable set polytope
A Galluccio, C Gentile, P Ventura
Operations Research Letters 36 (4), 419-423, 2008
262008
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
242020
Perspective Reformulations of the CTA Problem with L2 Distances
J Castro, A Frangioni, C Gentile
Operations Research 62 (4), 891-909, 2014
212014
Improving the approximated projected perspective reformulation by dual information
A Frangioni, F Furini, C Gentile
Operations Research Letters 45 (5), 519-524, 2017
182017
New MINLP formulations for the unit commitment problems with ramping constraints
T Bacci, A Frangioni, C Gentile, K Tavlaridis-Gyparakis
Optimization, 2019
142019
O sistema não pode efectuar a operação agora. Tente mais tarde.
Artigos 1–20