SDP Diagonalizations and Perspective Cuts for a Class of Nonseparable MIQP (2009)
Sdp Diagonalizations, Antonio Frangioni, Claudio Gentile, Antonio Frangioni, Claudio Gentile
Perspective cuts are a computationally effective family of valid inequalities, belonging to the general family of disjunctive cuts, for Mixed-Integer Convex NonLinear Programming problems with a...
Optimizing over Semimetric Polytopes (2009)
Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi
Let G = (V, E) be a complete graph. Then the semimetric polytope M(G) associated with G is defined by the following system of inequalities xij + xik + xjk ≤ 2 ⎪⎬
0-1 Reformulations of the Network Loading Problem (2008)
Antonio Frangioni, Bernard Gendron
et de recherche opérationnelle
Capizzano. Spectral Analysis of (Sequences of) Graph Matrices (2008)
Antonio Frangioni, Serra Capizzano
Abstract. We study the extreme singular values ofincidence graph matrices, obtaining lower and upper estimates that are asymptotically tight. This analysis is then used for obtaining estimates on the...
Outer approximation algorithms for canonical DC problems (2008)
Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang, Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang
The paper discusses a general framework for outer approximation type algorithms for the canonical DC optimization problem. A thorough analysis of properties which guarantee convergence is carried...
Deflected Conditional Approximate Subgradient Methods (2008)
Antonio Frangioni, Antonio Frangioni
Subgradient methods for constrained nondifferentiable problems benefit from projection of the search direction onto the (normal cone of) the feasible set prior to computing the steplength, that is,...
doi 10.1287/ijoc.1040.0081 (2008)
Antonio Frangioni, Antonio Manca
In the last two decades, a number of algorithms for the linear single-commodity min-cost flow (MCF) problem have been proposed, and several efficient codes are available that implement different...
Antonio Frangioni, Antonio Frangioni, Emiliano Necciari, Emiliano Necciari, Maria Grazia Scutella, Maria Grazia Scutella
A multi-exchange neighborhood for minimum makespan machine scheduling problems
Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron
Departement des sciences administratives
1 Generalized Bundle Methods (2007)
Abstract: We study a class of generalized bundle methods where the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithms from the...
Outer Approximation Algorithms for Canonical Reverse-Polar Problems (2007)
Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang, Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang
In this paper we propose a novel generalization of the canonical DC problem and we study the convergence of outer approximation (cutting planes) algorithms for its solution which use an...
0-1 Reformulations of the Multicommodity Capacitated Network Design Problem (2007)
Multicommodity Capacitated, Antonio Frangioni, Bernard Gendron, Antonio Frangioni, Bernard Gendron
Abstract. We study 0-1 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent, design decisions on the number of...
On the Choice of Explicit Stabilizing Terms in Column Generation (2007)
H. Ben Amor, A. Frangioni, J. Desrosiers, Hatem Ben Amor, Antonio Frangioni, Jacques Desrosiers, ...
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilité de leurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du...
A Computational Study of Cost Reoptimization for Min Cost Flow Problems (2006)
Antonio Frangioni, Antonio Frangioni, Antonio Manca, Antonio Manca
In the last two decades, a number of algorithms for the linear single-commodity Min Cost Flow problem (MCF) have been proposed, and several e#cient codes are available that implement di#erent...
Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints (2006)
informs ® doi 10.1287/opre.1060.0309 © 2006 INFORMS We present a dynamic programming algorithm for solving the single-unit commitment (1UC) problem with ramping constraints and arbitrary convex...
Antonio Frangioni, Emiliano Necciari, Maria Grazia Scutellà
multi-exchange neighborhood for minimum makespan machine
A parallel implementation of an interior-point algorithm for multicommodity network flows (2001)
Jordi Castro, Antonio Frangioni
DR2000-06 A parallel implementation of the specialized interior-point algorithm for multicommodity network ows introduced in [5] is presented. In this algorithm, the positive denite systems of each...
Fast Lower Bounds for the Capacitated Minimum Spanning Tree Problem (1999)
Antonio Frangioni, Daniele Pretolani, Maria Grazia Scutella, D. Pretolaniy, M. G. Scutell`a\lambda
Multi-Exchange Algorithms for the Minimum Makespan Machine Scheduling Problem (1999)
Antonio Frangioni, M. G. Scutella, Emiliano Necciari, Antonio Frangioni, Emiliano Necciari, Maria Grazia Scutellà
We address the problem of scheduling independent jobs to identical parallel machines in order to minimize the completion time (makespan). This is a hard problem, for which both constructive and...
Generalized bundle methods (1998)
Abstract. We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithms from...
Generalized bundle methods (1998)
Antonio Frangioni, Antonio Frangioni
Abstract: We study a class of generalized bundle methods where the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithms from the...
Bernard Gendron, Teodor Gabriel Crainic, Antonio Frangioni
et de recherche operationnelle Centre de recherche sur les transports
We study the coarse-grained parallelization of an efficient bundle-based costdecomposition algorithm for the solution of multicommodity min-cost flow (MMCF) problems. We show that a code exploiting...
Abstract: We extend some known results about the Bilevel Linear Problem (BLP), a hierarchical two-stage optimization problem, showing how it can be used to reformulate any Mixed Integer (Linear)...