Antonio Frangioni - Google Scholar

Cited by

	All	Since 2015
Citations	4040	1976
h-index	31	25
i10-index	55	43

400

200

100

300

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202021 17 36 43 64 63 97 73 121 107 155 179 185 242 270 308 282 314 382 381 358 255

Co-authors

Fabrizio LacalandraNoneVerified email at quantek.it
Bernard GendronProfessor, Université de MontréalVerified email at cirrelt.ca
Claudia D'AmbrosioCNRS researcher, LIX Ecole PolytechniqueVerified email at lix.polytechnique.fr
Maria Grazia Scutella'Dipartimento di Informatica Universita' di PisaVerified email at di.unipi.it
Andrea LodiPolytechnique MontréalVerified email at polymtl.ca
Leo LibertiCNRS LIX, Ecole PolytechniqueVerified email at lix.polytechnique.fr
Wim van AckooijEDF R&DVerified email at edf.fr
Enrico GorgoneUniversità di CagliariVerified email at unica.it
Alberto BorghettiUniversity of Bologna - ItalyVerified email at unibo.it
Carlo Alberto NucciProfessor of Electrical Power SystemsVerified email at unibo.it
Giovanni SteaAssociate Professor of Computer Engineering, University of Pisa, ItalyVerified email at unipi.it
Laura GalliRicercatore TD-B, Department of Computer Science, University of PisaVerified email at unipi.it
Teodor Gabriel CrainicESG, UQAM and CIRRELTVerified email at cirrelt.ca
Jordi CastroDept. of Stat. and Operations Research, Universitat Politècnica de Catalunya, BarcelonaVerified email at upc.edu
Jacques DesrosiersProfessor, HEC MontréalVerified email at hec.ca
Agostino VirdisVerified email at med.unipi.it
Davide CherubiniVodafone Group ServicesVerified email at vodafone.com
Giorgio GalloUniversity of PisaVerified email at di.unipi.it
Dario SabellaIntelVerified email at intel.com
Fabio FuriniNational Research CouncilVerified email at iasi.cnr.it

Antonio Frangioni

Dipartimento di Informatica, Università di Pisa

Verified email at di.unipi.it - Homepage

Continuous and Combinatorial Optimization


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Multicommodity capacitated network design B Gendron, TG Crainic, A Frangioni Telecommunications network planning, 1-19, 1999	298	1999
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	297	2001
Tighter approximated MILP formulations for unit commitment problems A Frangioni, C Gentile, F Lacalandra IEEE Transactions on Power Systems 24 (1), 105-113, 2008	265	2008
Perspective cuts for a class of convex 0–1 mixed integer programs A Frangioni, C Gentile Mathematical Programming 106 (2), 225-236, 2006	227	2006
Generalized bundle methods A Frangioni SIAM Journal on Optimization 13 (1), 117-156, 2002	198	2002
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	167	2003
0–1 reformulations of the multicommodity capacitated network design problem A Frangioni, B Gendron Discrete Applied Mathematics 157 (6), 1229-1241, 2009	132	2009
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	129	1999
Solving nonlinear single-unit commitment problems with ramping constraints A Frangioni, C Gentile Operations Research 54 (4), 767-775, 2006	128	2006
About Lagrangian methods in integer optimization A Frangioni Annals of Operations Research 139 (1), 163-193, 2005	127	2005
On the choice of explicit stabilizing terms in column generation HMTB Amor, J Desrosiers, A Frangioni Discrete Applied Mathematics 157 (6), 1167-1184, 2009	121	2009
Large-scale unit commitment under uncertainty M Tahanan, W van Ackooij, A Frangioni, F Lacalandra 4OR 13 (2), 115-171, 2015	94	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	93	2008
Solving semidefinite quadratic problems within nonsmooth optimization algorithms A Frangioni Computers & Operations Research 23 (11), 1099-1118, 1996	85	1996
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	75	2009
A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems A Frangioni, E Necciari, MG Scutella Journal of Combinatorial Optimization 8 (2), 195-220, 2004	75	2004
A storm of feasibility pumps for nonconvex MINLP C D’Ambrosio, A Frangioni, L Liberti, A Lodi Mathematical programming 136 (2), 375-402, 2012	73	2012
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP A Frangioni, C Gentile Operations Research Letters 35 (2), 181-185, 2007	70	2007
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	69	2011
Bundle methods for sum-functions with “easy” components: applications to multicommodity network design A Frangioni, E Gorgone Mathematical Programming 145 (1-2), 133-161, 2014	67	2014

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors