Antonio Frangioni

Kostas Tavlaridis-Gyparakis

Oper. Res., 2024

A bilevel programming approach to price decoupling in Pay-as-Clear markets, with application to day-ahead electricity markets.

[BibT_eX]

[DOI]

Fabrizio Lacalandra

Eur. J. Oper. Res., 2024

The Algorithm Configuration Problem.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Deep Neural Networks Pruning via the Structured Perspective Regularization.

[BibT_eX]

[DOI]

SIAM J. Math. Data Sci., December, 2023

Comparing perspective reformulations for piecewise-convex optimization.

[BibT_eX]

[DOI]

Renan Spencer Trindade

Claudia D'Ambrosio

Oper. Res. Lett., November, 2023

Ellipsoidal classification via semidefinite programming.

[BibT_eX]

[DOI]

Oper. Res. Lett., March, 2023

In Memoriam: Bernard Gendron,1966-2022.

[BibT_eX]

[DOI]

Michel Gendreau

Transp. Sci., January, 2023

Structured Pruning of Neural Networks for Constraints Learning.

[BibT_eX]

[DOI]

Matteo Cacciola

Andrea Lodi

CoRR, 2023

On the Convergence of Stochastic Gradient Descent in Low-Precision Number Formats.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Pattern Recognition Applications and Methods, 2023

2022

Bernard Gendron (1966-2022): Un ami et un collègue.

[BibT_eX]

[DOI]

Michel Gendreau

INFOR Inf. Syst. Oper. Res., 2022

Bernard Gendron (1966-2022): friend and colleague.

[BibT_eX]

[DOI]

Mohammad Rahim Akhavan Kazemzadeh

Michel Gendreau

INFOR Inf. Syst. Oper. Res., 2022

Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design.

[BibT_eX]

[DOI]

Tolga Bektas

Discret. Appl. Math., 2022

A MILP approach to DRAM access worst-case analysis.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

2021

A constraints-aware Reweighted Feasibility Pump approach.

[BibT_eX]

[DOI]

Stefania Pan

Emiliano Traversi

Roberto Wolfler Calvo

Oper. Res. Lett., 2021

A multiperiod drayage problem with customer-dependent service periods.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

2020

Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs.

[BibT_eX]

[DOI]

James T. Hungerford

Math. Oper. Res., 2020

Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy.

[BibT_eX]

[DOI]

Daniel Baena

Jordi Castro

Manag. Sci., 2020

A Learning-Based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning, Optimization, and Data Science, 2020

Learning to Configure Mathematical Programming Solvers by Mathematical Programming.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

Quasi-Separable Dantzig-Wolfe Reformulations for Network Design.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Bicriteria Data Compression.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Strengthening the sequential convex MINLP technique by perspective reformulations.

[BibT_eX]

[DOI]

Claudia D'Ambrosio

Optim. Lett., 2019

QPLIB: a library of quadratic programming instances.

[BibT_eX]

[DOI]

Nikolaos V. Sahinidis

Stefan Vigerske

Angelika Wiegele

Math. Program. Comput., 2019

2018

Incremental Bundle Methods using Upper Models.

[BibT_eX]

[DOI]

Wim van Ackooij

SIAM J. Optim., 2018

Dynamic smoothness parameter for fast gradient methods.

[BibT_eX]

[DOI]

Optim. Lett., 2018

Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G.

[BibT_eX]

[DOI]

Gian Michele Dell'Aera

J. Netw. Comput. Appl., 2018

A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Towards Robust Admission Control in Delay-Constrained Routing Problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Large-scale unit commitment under uncertainty: an updated literature survey.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2018

Minimizing Power Consumption in Virtualized Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the 87th IEEE Vehicular Technology Conference, 2018

2017

Improving the Approximated Projected Perspective Reformulation by dual information.

[BibT_eX]

[DOI]

Fabio Furini

Oper. Res. Lett., 2017

On the computational efficiency of subgradient methods: a case study with Lagrangian bounds.

[BibT_eX]

[DOI]

Math. Program. Comput., 2017

Special issue on: Nonlinear and combinatorial methods for energy optimization.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2017

Delay-constrained routing problems: Accurate scheduling models and admission control.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

QoS routing with worst-case delay constraints: Models, algorithms and performance analysis.

[BibT_eX]

[DOI]

Comput. Commun., 2017

Flexible dynamic coordinated scheduling in virtual-RAN deployments.

[BibT_eX]

[DOI]

Gian Michele Dell'Aera

Marco Caretti

Proceedings of the 2017 IEEE International Conference on Communications Workshops, 2017

2016

Approximated perspective relaxations: a project and lift approach.

[BibT_eX]

[DOI]

Fabio Furini

Comput. Optim. Appl., 2016

Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support.

[BibT_eX]

[DOI]

Wim van Ackooij

Welington de Oliveira

Comput. Optim. Appl., 2016

Statistically Sound Experiments with OpenAirInterface Cloud-RAN Prototypes - CLEEN 2016.

[BibT_eX]

[DOI]

Proceedings of the Cognitive Radio Oriented Wireless Networks, 2016

2015

Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2015

Optimal Joint Path Computation and Rate Allocation for Real-time Traffic.

[BibT_eX]

[DOI]

Comput. J., 2015

Accelerated multigrid for graph Laplacian operators.

[BibT_eX]

[DOI]

Pietro Dell'Acqua

Stefano Serra-Capizzano

Appl. Math. Comput., 2015

Large-scale Unit Commitment under uncertainty.

[BibT_eX]

[DOI]

4OR, 2015

2014

Bundle methods for sum-functions with "easy" components: applications to multicommodity network design.

[BibT_eX]

[DOI]

Math. Program., 2014

Perspective Reformulations of the CTA Problem with L2 Distances.

[BibT_eX]

[DOI]

Jordi Castro

Oper. Res., 2014

Pairwise Compatibility Graphs of Caterpillars.

[BibT_eX]

[DOI]

Tiziana Calamoneri

Blerina Sinaimeri

Comput. J., 2014

2013

A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

Preface.

[BibT_eX]

[DOI]

Michael L. Overton

Claudia A. Sagastizábal

Math. Program., 2013

A stabilized structured Dantzig-Wolfe decomposition method.

[BibT_eX]

[DOI]

Math. Program., 2013

A library for continuous convex separable quadratic knapsack problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2013

2012

A storm of feasibility pumps for nonconvex MINLP.

[BibT_eX]

[DOI]

Math. Program., 2012

Beyond Canonical DC-Optimization: The Single Reverse Polar Problem.

[BibT_eX]

[DOI]

Giancarlo Bigi

Qinghua Zhang

J. Optim. Theory Appl., 2012

2011

Piecewise-quadratic Approximations in Convex Numerical Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2011

Static and dynamic routing under disjoint dominant extreme demands.

[BibT_eX]

[DOI]

F. Pascali

Oper. Res. Lett., 2011

Projected Perspective Reformulations with Applications in Design Problems.

[BibT_eX]

[DOI]

Oper. Res., 2011

Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE.

[BibT_eX]

[DOI]

Paola Zuddas

Comput. Oper. Res., 2011

Transforming Mathematical Models Using Declarative Reformulation Rules.

[BibT_eX]

[DOI]

Luis Perez Sanchez

Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011

2010

On interval-subgradient and no-good cuts.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Approximate optimality conditions and stopping criteria in canonical DC programming.

[BibT_eX]

[DOI]

Giancarlo Bigi

Qinghua Zhang

Optim. Methods Softw., 2010

Outer approximation algorithms for canonical DC problems.

[BibT_eX]

[DOI]

Giancarlo Bigi

Qinghua Zhang

J. Glob. Optim., 2010

I-DARE: Intelligence-Driven Automatic Reformulation Engine.

[BibT_eX]

[DOI]

Luis Perez Sanchez

ERCIM News, 2010

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Searching the Best (Formulation, Solver, Configuration) for Structured Problems.

[BibT_eX]

[DOI]

Luis Perez Sanchez

Proceedings of the Complex Systems Design & Management, 2010

2009

Convergence Analysis of Deflected Conditional Approximate Subgradient Methods.

[BibT_eX]

[DOI]

Giacomo d'Antonio

SIAM J. Optim., 2009

A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

0-1 reformulations of the multicommodity capacitated network design problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

On the choice of explicit stabilizing terms in column generation.

[BibT_eX]

[DOI]

Hatem Ben Amor

Jacques Desrosiers

Discret. Appl. Math., 2009

Primary and backup paths optimal design for traffic engineering in hybrid IGP/MPLS networks.

[BibT_eX]

[DOI]

Proceedings of the 7th International Workshop on Design of Reliable Communication Networks, 2009

2007

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

Experiments with a hybrid interior point/combinatorial approach for network flow problems.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2007

Prim-based support-graph preconditioners for min-cost flow problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2007

2006

Perspective cuts for a class of convex 0-1 mixed integer programs.

[BibT_eX]

[DOI]

Math. Program., 2006

Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints.

[BibT_eX]

[DOI]

Oper. Res., 2006

A Computational Study of Cost Reoptimization for Min-Cost Flow Problems.

[BibT_eX]

[DOI]

Antonio Manca

INFORMS J. Comput., 2006

2005

New approaches for optimizing over the semimetric polytope.

[BibT_eX]

[DOI]

Andrea Lodi

Giovanni Rinaldi

Math. Program., 2005

About Lagrangian Methods in Integer Optimization.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2005

2004

New Preconditioners for KKT Systems of Network Flow Problems.

[BibT_eX]

[DOI]

SIAM J. Optim., 2004

A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems.

[BibT_eX]

[DOI]

Emiliano Necciari

J. Comb. Optim., 2004

Optimizing over Semimetric Polytopes.

[BibT_eX]

[DOI]

Andrea Lodi

Giovanni Rinaldi

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

PaTre: A Method for Paralogy Trees Construction.

[BibT_eX]

[DOI]

J. Comput. Biol., 2003

Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems.

[BibT_eX]

[DOI]

Paola Cappanera

INFORMS J. Comput., 2003

2002

Generalized Bundle Methods.

[BibT_eX]

[DOI]

SIAM J. Optim., 2002

2001

Spectral Analysis of (Sequences of) Graph Matrices.

[BibT_eX]

[DOI]

Stefano Serra-Capizzano

SIAM J. Matrix Anal. Appl., 2001

Bundle-based relaxation methods for multicommodity capacitated fixed charge network design.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows.

[BibT_eX]

[DOI]

Jordi Castro

Proceedings of the Vector and Parallel Processing, 2000

1999

A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems.

[BibT_eX]

[DOI]

Giorgio Gallo

INFORMS J. Comput., 1999

1996

Solving semidefinite quadratic problems within nonsmooth optimization algorithms.

[BibT_eX]

[DOI]