Követés
ANTONIO FRANGIONI
ANTONIO FRANGIONI
Dipartimento di Informatica, Università di Pisa
E-mail megerősítve itt: unipi.it - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
TG Crainic, A Frangioni, B Gendron
Discrete Applied Mathematics 112 (1-3), 73-99, 2001
3782001
Multicommodity capacitated network design
B Gendron, TG Crainic, A Frangioni
Telecommunications network planning, 1-19, 1999
3561999
Tighter approximated MILP formulations for unit commitment problems
A Frangioni, C Gentile, F Lacalandra
IEEE Transactions on Power Systems 24 (1), 105-113, 2008
3542008
Perspective cuts for a class of convex 0–1 mixed integer programs
A Frangioni, C Gentile
Mathematical Programming 106, 225-236, 2006
3532006
Generalized bundle methods
A Frangioni
SIAM Journal on Optimization 13 (1), 117-156, 2002
2462002
Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment
A Borghetti, A Frangioni, F Lacalandra, CA Nucci
IEEE Transactions on Power Systems 18 (1), 313-323, 2003
2102003
Large-scale unit commitment under uncertainty: an updated literature survey
W Van Ackooij, I Danti Lopez, A Frangioni, F Lacalandra, M Tahanan
Annals of Operations Research 271 (1), 11-85, 2018
1902018
Large-scale unit commitment under uncertainty
M Tahanan, W van Ackooij, A Frangioni, F Lacalandra
4or 13, 115-171, 2015
1812015
0–1 reformulations of the multicommodity capacitated network design problem
A Frangioni, B Gendron
Discrete Applied Mathematics 157 (6), 1229-1241, 2009
1652009
Solving nonlinear single-unit commitment problems with ramping constraints
A Frangioni, C Gentile
Operations Research 54 (4), 767-775, 2006
1652006
About Lagrangian methods in integer optimization
A Frangioni
Annals of Operations Research 139, 163-193, 2005
1632005
On the choice of explicit stabilizing terms in column generation
HMTB Amor, J Desrosiers, A Frangioni
Discrete Applied Mathematics 157 (6), 1167-1184, 2009
1542009
A bundle type dual-ascent approach to linear multicommodity min-cost flow problems
A Frangioni, G Gallo
INFORMS Journal on Computing 11 (4), 370-393, 1999
1491999
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
A Frangioni, C Gentile
Operations Research Letters 35 (2), 181-185, 2007
1212007
QPLIB: a library of quadratic programming instances
F Furini, E Traversi, P Belotti, A Frangioni, A Gleixner, N Gould, L Liberti, ...
Mathematical Programming Computation 11, 237-265, 2019
1172019
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
1162008
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
1082009
A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
A Frangioni, E Necciari, MG Scutella
Journal of Combinatorial Optimization 8, 195-220, 2004
1042004
A storm of feasibility pumps for nonconvex MINLP
C D’Ambrosio, A Frangioni, L Liberti, A Lodi
Mathematical programming 136, 375-402, 2012
1012012
Solving semidefinite quadratic problems within nonsmooth optimization algorithms
A Frangioni
Computers & Operations Research 23 (11), 1099-1118, 1996
981996
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20