| 2007 |
|---|
| 12 | EE | Antonio Frangioni,
Claudio Gentile:
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP.
Oper. Res. Lett. 35(2): 181-185 (2007) |
| 2006 |
|---|
| 11 | EE | Antonio Frangioni,
Antonio Manca:
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems.
INFORMS Journal on Computing 18(1): 61-70 (2006) |
| 10 | EE | Antonio Frangioni,
Claudio Gentile:
Perspective cuts for a class of convex 0-1 mixed integer programs.
Math. Program. 106(2): 225-236 (2006) |
| 2005 |
|---|
| 9 | EE | Antonio Frangioni:
About Lagrangian Methods in Integer Optimization.
Annals OR 139(1): 163-193 (2005) |
| 8 | EE | Antonio Frangioni,
Andrea Lodi,
Giovanni Rinaldi:
New approaches for optimizing over the semimetric polytope.
Math. Program. 104(2-3): 375-388 (2005) |
| 2004 |
|---|
| 7 | EE | Antonio Frangioni,
Andrea Lodi,
Giovanni Rinaldi:
Optimizing over Semimetric Polytopes.
IPCO 2004: 431-443 |
| 6 | EE | 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) |
| 2003 |
|---|
| 5 | EE | 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) |
| 4 | EE | 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) |
| 2001 |
|---|
| 3 | | 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 |
|---|
| 2 | EE | Jordi Castro,
Antonio Frangioni:
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows.
VECPAR 2000: 301-315 |
| 1996 |
|---|
| 1 | EE | Antonio Frangioni:
Solving semidefinite quadratic problems within nonsmooth optimization algorithms.
Computers & OR 23(11): 1099-1118 (1996) |
