Efficient formulations and solution methods

Projects

p-Lagrangian relaxation

Efficient decomposition methods for MIQCQPs using Lagrangian decomposition and parallelisation

Publications

Combining penalty-based and Gauss-Seidel methods for solving stochastic mixed-integer problems (2020)

A multi-start local search heuristic for the Green Vehicle Routing Problem based on a multigraph reformulation (2019)

An enhanced L-Shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming (2019)

A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (2019)

Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (2019)

Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming (2018)

An Exact Algorithm for the Green Vehicle Routing Problem (2017)

A Strategy Based on Convex Relaxation for Solving the Oil Refinery Operations Planning Problem (2016)

Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (2014)