0–1 reformulations of the multicommodity capacitated network design problem

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

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

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

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

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

A library for continuous convex separable quadratic knapsack problems

A matheuristic for integrated timetabling and vehicle scheduling

A stabilized structured Dantzig–Wolfe decomposition method

A storm of feasibility pumps for nonconvex MINLP

About Lagrangian Methods in Integer Optimization

Accelerated multigrid for graph Laplacian operators

Approximate optimality conditions and stopping criteria in canonical DC programming

Approximated perspective relaxations: a project and lift approach

Beyond Canonical DC-Optimization: The Single Reverse Polar Problem

Bicriteria Data Compression

Bicriteria data compression

Bundle methods for sum-functions with “easy” components: applications to multicommodity network design

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

Comparing Spatial and Scenario Decomposition for Stochastic Hydrothermal Unit Commitment Problems

Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems

Convergence Analysis of Deflected Conditional Approximate Subgradient Methods

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

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

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

article by Antonio Frangioni et al published May 2017 in Computers and Operations Research

Dynamic smoothness parameter for fast gradient methods

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs

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

Generalized Bundle Methods

Improving the Approximated Projected Perspective Reformulation by dual information

scholarly article by Antonio Frangioni et al published September 2017 in Operations Research Letters

Incremental Bundle Methods using Upper Models

Large-scale Unit Commitment under uncertainty

Learning to Configure Mathematical Programming Solvers by Mathematical Programming

Multicommodity Capacitated Network Design

New approaches for optimizing over the semimetric polytope

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

On a new class of bilevel programming problems and its use for reformulating mixed integer problems

On interval-subgradient and no-good cuts

On the choice of explicit stabilizing terms in column generation

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

Optimal sizing of energy communities with fair revenue sharing and exit clauses: Value, role and business model of aggregators and users

Optimizing over Semimetric Polytopes

Outer approximation algorithms for canonical DC problems

PaTre: a method for paralogy trees construction.

artículo científico publicado en 2003

Perspective Reformulations of the CTA Problem with L 2 Distances

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

Projected Perspective Reformulations with Applications in Design Problems

QPLIB: a library of quadratic programming instances

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

Quasi-Separable Dantzig-Wolfe Reformulations for Network Design

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP

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

Sequential Lagrangian-MILP approaches for Unit Commitment problems

Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints

Solving semidefinite quadratic problems within nonsmooth optimization algorithms

Solving unit commitment problems with general ramp constraints

Special issue on: Nonlinear and combinatorial methods for energy optimization

Spectral Analysis of (Sequences of) Graph Matrices

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

Statistically Sound Experiments with OpenAirInterface Cloud-RAN Prototypes

Strengthening the sequential convex MINLP technique by perspective reformulations

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

Towards Robust Admission Control in Delay-Constrained Routing Problems

Transforming Mathematical Models Using Declarative Reformulation Rules