claudio gentile
claudio gentile
Consiglio Nazionale delle Ricerche, Istituto di Analisi dei Sistemi ed Informatica, IASI-CNR
Nessuna email verificata
Titolo
Citata da
Citata da
Anno
Tighter approximated MILP formulations for unit commitment problems
A Frangioni, C Gentile, F Lacalandra
Power Systems, IEEE Transactions on 24 (1), 105-113, 2009
2692009
Perspective cuts for a class of convex 0–1 mixed integer programs
A Frangioni, C Gentile
Mathematical Programming 106 (2), 225-236, 2006
2322006
Solving nonlinear single-unit commitment problems with ramping constraints
A Frangioni, C Gentile
Operations Research 54 (4), 767-775, 2006
1282006
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
932008
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
752009
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
712011
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
A Frangioni, C Gentile
Operations Research Letters 35 (2), 181-185, 2007
712007
A polyhedral approach for the staff rostering problem
G Felici, C Gentile
Management Science 50 (3), 381-393, 2004
552004
Max Horn SAT and the minimum cut problem in directed hypergraphs
G Gallo, C Gentile, D Pretolani, G Rago
Mathematical Programming 80 (2), 213-237, 1998
451998
Projected perspective reformulations with applications in design problems
A Frangioni, C Gentile, E Grande, A Pacifici
Operations research 59 (5), 1225-1232, 2011
392011
New preconditioners for KKT systems of network flow problems
A Frangioni, C Gentile
SIAM Journal on Optimization 14 (3), 894-913, 2004
302004
Approximated Perspective Relaxations: a Project&Lift Approach
A Frangioni, F Furini, C Gentile
29*
Gear composition and the stable set polytope
A Galluccio, C Gentile, P Ventura
Operations Research Letters 36 (4), 419-423, 2008
202008
Perspective reformulations of the CTA problem with L 2 distances
J Castro, A Frangioni, C Gentile
Operations Research 62 (4), 891-909, 2014
172014
Prim-based support-graph preconditioners for min-cost flow problems
A Frangioni, C Gentile
Computational Optimization and Applications 36 (2-3), 271-287, 2007
122007
Gear composition of stable set polytopes and G-perfection
A Galluccio, C Gentile, P Ventura
Mathematics of Operations Research 34 (4), 813-836, 2009
92009
Solving large MIP models in supply chain management by branch & cut
G Felici, C Gentile, G Rinaldi
IASI-CNR Research Report, 2000
92000
Mod-2 cuts generation yields the convex hull of bounded integer feasible sets
C Gentile, P Ventura, R Weismantel
SIAM Journal on Discrete Mathematics 20 (4), 913-919, 2006
72006
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect
A Galluccio, C Gentile, P Ventura
Journal of Combinatorial Theory, Series B 108, 1-28, 2014
62014
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect
A Galluccio, C Gentile, P Ventura
Journal of Combinatorial Theory, Series B 107, 92-122, 2014
62014
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20