Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Antonio Frangioni
2010 – today
- 2013
[j30]Antonio Frangioni, Enrico Gorgone: A library for continuous convex separable quadratic knapsack problems. European Journal of Operational Research 229(1): 37-40 (2013)- 2012
[j29]Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang: Beyond Canonical DC-Optimization: The Single Reverse Polar Problem. J. Optimization Theory and Applications 155(2): 430-452 (2012)
[j28]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi: A storm of feasibility pumps for nonconvex MINLP. Math. Program. 136(2): 375-402 (2012)- 2011
[j27]D. Cherubini, A. Fanni, A. Mereu, Antonio Frangioni, C. Murgia, Maria Grazia Scutellà, P. Zuddas: Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE. Computers & OR 38(12): 1805-1815 (2011)
[j26]Antonio Frangioni, Claudio Gentile, Enrico Grande, Andrea Pacifici: Projected Perspective Reformulations with Applications in Design Problems. Operations Research 59(5): 1225-1232 (2011)
[j25]Antonio Frangioni, F. Pascali, Maria Grazia Scutellà: Static and dynamic routing under disjoint dominant extreme demands. Oper. Res. Lett. 39(1): 36-39 (2011)
[j24]Annabella Astorino, Antonio Frangioni, Manlio Gaudioso, Enrico Gorgone: Piecewise-quadratic Approximations in Convex Numerical Optimization. SIAM Journal on Optimization 21(4): 1418-1438 (2011)
[c5]Antonio Frangioni, Luis Perez Sanchez: Transforming Mathematical Models Using Declarative Reformulation Rules. LION 2011: 407-422- 2010
[j23]Antonio Frangioni, Luis Perez Sanchez: I-DARE: Intelligence-Driven Automatic Reformulation Engine. ERCIM News 2010(81) (2010)
[j22]Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang: Outer approximation algorithms for canonical DC problems. J. Global Optimization 46(2): 163-189 (2010)
[j21]Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang: Approximate optimality conditions and stopping criteria in canonical DC programming. Optimization Methods and Software 25(1): 19-27 (2010)
[j20]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi: On interval-subgradient and no-good cuts. Oper. Res. Lett. 38(5): 341-345 (2010)
[c4]Antonio Frangioni, Luis Perez Sanchez: Searching the Best (Formulation, Solver, Configuration) for Structured Problems. CSDM 2010: 85-98
[c3]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi: Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. SEA 2010: 350-360
2000 – 2009
- 2009
[j19]Hatem Ben Amor, Jacques Desrosiers, Antonio Frangioni: On the choice of explicit stabilizing terms in column generation. Discrete Applied Mathematics 157(6): 1167-1184 (2009)
[j18]Antonio Frangioni, Bernard Gendron: 0-1 reformulations of the multicommodity capacitated network design problem. Discrete Applied Mathematics 157(6): 1229-1241 (2009)
[j17]Antonio Frangioni, Claudio Gentile: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes. Oper. Res. Lett. 37(3): 206-210 (2009)
[j16]Giacomo d'Antonio, Antonio Frangioni: Convergence Analysis of Deflected Conditional Approximate Subgradient Methods. SIAM Journal on Optimization 20(1): 357-386 (2009)- 2007
[j15]Antonio Frangioni, Claudio Gentile: Prim-based support-graph preconditioners for min-cost flow problems. Comp. Opt. and Appl. 36(2-3): 271-287 (2007)
[j14]Antonio Frangioni, Claudio Gentile: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP. Oper. Res. Lett. 35(2): 181-185 (2007)- 2006
[j13]Antonio Frangioni, Antonio Manca: A Computational Study of Cost Reoptimization for Min-Cost Flow Problems. INFORMS Journal on Computing 18(1): 61-70 (2006)
[j12]Antonio Frangioni, Claudio Gentile: Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints. Operations Research 54(4): 767-775 (2006)
[j11]Antonio Frangioni, Claudio Gentile: Perspective cuts for a class of convex 0-1 mixed integer programs. Math. Program. 106(2): 225-236 (2006)- 2005
[j10]Antonio Frangioni: About Lagrangian Methods in Integer Optimization. Annals OR 139(1): 163-193 (2005)
[j9]Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi: New approaches for optimizing over the semimetric polytope. Math. Program. 104(2-3): 375-388 (2005)- 2004
[j8]Antonio Frangioni, Emiliano Necciari, Maria Grazia Scutellà: A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems. J. Comb. Optim. 8(2): 195-220 (2004)
[j7]Antonio Frangioni, Claudio Gentile: New Preconditioners for KKT Systems of Network Flow Problems. SIAM Journal on Optimization 14(3): 894-913 (2004)
[c2]Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi: Optimizing over Semimetric Polytopes. IPCO 2004: 431-443- 2003
[j6]Paola Cappanera, Antonio Frangioni: Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems. INFORMS Journal on Computing 15(4): 369-384 (2003)
[j5]Nadia Pisanti, Roberto Marangoni, Paolo Ferragina, Antonio Frangioni, A. Savona, C. Pisanelli, Fabrizio Luccio: PaTre: A Method for Paralogy Trees Construction. Journal of Computational Biology 10(5): 791-802 (2003)- 2002
[j4]- 2001
[j3]Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Applied Mathematics 112(1-3): 73-99 (2001)- 2000
[c1]Jordi Castro, Antonio Frangioni: A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows. VECPAR 2000: 301-315
1990 – 1999
- 1999
[j2]Antonio Frangioni, Giorgio Gallo: A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems. INFORMS Journal on Computing 11(4): 370-393 (1999)- 1996
[j1]Antonio Frangioni: Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Computers & OR 23(11): 1099-1118 (1996)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-10 21:59 CEST by the dblp team



