Search Results - "Frangioni, Antonio"
-
1
Approximated perspective relaxations: a project and lift approach
Published in Computational optimization and applications (01-04-2016)“…The perspective reformulation (PR) of a Mixed-Integer NonLinear Program with semi-continuous variables is obtained by replacing each term in the (separable)…”
Get full text
Journal Article -
2
A storm of feasibility pumps for nonconvex MINLP
Published in Mathematical programming (01-12-2012)“…One of the foremost difficulties in solving Mixed-Integer Nonlinear Programs, either with exact or heuristic methods, is to find a feasible point. We address…”
Get full text
Journal Article Conference Proceeding -
3
QPLIB: a library of quadratic programming instances
Published in Mathematical programming computation (01-06-2019)“…This paper describes a new instance library for quadratic programming (QP), i.e., the family of continuous and (mixed)-integer optimization problems where the…”
Get full text
Journal Article -
4
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
Published in Operations research letters (01-03-2007)“…We present a new approach, requiring the solution of a SemiDefinite Program, for decomposing the Hessian of a nonseparable mixed-integer quadratic problem to…”
Get full text
Journal Article -
5
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Published in Discrete Applied Mathematics (15-09-2001)“…To efficiently derive bounds for large-scale instances of the capacitated fixed-charge network design problem, Lagrangian relaxations appear promising. This…”
Get full text
Journal Article Conference Proceeding -
6
Special issue on: Nonlinear and combinatorial methods for energy optimization
Published in EURO journal on computational optimization (01-03-2017)Get full text
Journal Article -
7
Optimal sizing of energy communities with fair revenue sharing and exit clauses: Value, role and business model of aggregators and users
Published in Applied energy (01-10-2021)“…Energy communities (ECs) are essential tools to meet the Energy Transition goals but, to fully unleash their potential, they require a coordinated operation…”
Get full text
Journal Article -
8
Bundle methods for sum-functions with “easy” components: applications to multicommodity network design
Published in Mathematical programming (01-06-2014)“…We propose a version of the bundle scheme for convex nondifferentiable optimization suitable for the case of a sum-function where some of the components are…”
Get full text
Journal Article -
9
A bilevel programming approach to price decoupling in Pay-as-Clear markets, with application to day-ahead electricity markets
Published in European journal of operational research (16-11-2024)“…Motivated by the recent crisis of the European electricity markets, we propose the concept of Segmented Pay-as-Clear (SPaC) market, introducing a new family of…”
Get full text
Journal Article -
10
Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy
Published in Management science (01-07-2020)“…The cell-suppression problem (CSP) is a very large mixed-integer linear problem arising in statistical disclosure control. However, CSP has the typical…”
Get full text
Journal Article -
11
Structured pruning of neural networks for constraints learning
Published in Operations research letters (01-11-2024)“…In recent years, the integration of Machine Learning (ML) models with Operation Research (OR) tools has gained popularity in applications such as cancer…”
Get full text
Journal Article -
12
A stabilized structured Dantzig–Wolfe decomposition method
Published in Mathematical programming (01-08-2013)“…We discuss an algorithmic scheme, which we call the stabilized structured Dantzig–Wolfe decomposition method, for solving large-scale structured linear…”
Get full text
Journal Article -
13
0–1 reformulations of the multicommodity capacitated network design problem
Published in Discrete Applied Mathematics (28-03-2009)“…We study 0–1 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent…”
Get full text
Journal Article -
14
Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
Published in Operations research (01-07-2006)“…We present a dynamic programming algorithm for solving the single-unit commitment (1UC) problem with ramping constraints and arbitrary convex cost functions…”
Get full text
Journal Article -
15
A MILP approach to DRAM access worst-case analysis
Published in Computers & operations research (01-07-2022)“…The Dynamic Random Access Memory (DRAM) is among the major points of contention in multi-core systems. We consider a challenging optimization problem arising…”
Get full text
Journal Article -
16
A library for continuous convex separable quadratic knapsack problems
Published in European journal of operational research (16-08-2013)“…► We describe an open-source C++ library for the solution of convex continuous quadratic knapsack problems. ► The library revolves around an abstract base…”
Get full text
Journal Article -
17
Comparing perspective reformulations for piecewise-convex optimization
Published in Operations research letters (01-11-2023)“…We aim at generalizing formulations for non-convex piecewise-linear problems to mathematical programs whose non-convexities are only expressed in terms of…”
Get full text
Journal Article -
18
Ellipsoidal classification via semidefinite programming
Published in Operations research letters (01-03-2023)“…We propose a classification approach exploiting relationships between ellipsoidal separation and Support-vector Machine (SVM) with quadratic kernel. By adding…”
Get full text
Journal Article -
19
A matheuristic for integrated timetabling and vehicle scheduling
Published in Transportation research. Part B: methodological (01-09-2019)“…•A new model for integrated timetabling (TT) and vehicle scheduling (VS).•First matheuristic for integrated TT and VS with regularity objective…”
Get full text
Journal Article -
20
Improving the Approximated Projected Perspective Reformulation by dual information
Published in Operations research letters (01-09-2017)“…We propose an improvement of the Approximated Projected Perspective Reformulation (AP2R) for dealing with constraints linking the binary variables. The new…”
Get full text
Journal Article