28 citations · 98 across the 25 of their papers we have counts for
30 papers
A computational comparison of handling distance constraints in MINLP
Christopher Hojny, Leo Liberti
Minimum distance constraints (minDCs) appear in many geometric optimization problems. They pose major challenges for mixed-integer nonlinear programming (MINLP) due to their revers…
The Algorithm Configuration Problem
Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni +1
The field of algorithmic optimization has significantly advanced with the development of methods for the automatic configuration of algorithmic parameters. This article delves into…
Learning to Configure Mathematical Programming Solvers by Mathematical Programming
Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni +1
We discuss the issue of finding a good mathematical programming solver configuration for a particular instance of a given problem, and we propose a two-phase approach to solve it.…
A learning-based mathematical programming formulation for the automatic configuration of optimization solvers
Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni +1
We propose a methodology, based on machine learning and optimization, for selecting a solver configuration for a given instance. First, we employ a set of solved instances and conf…
Submodular maximization and its generalization through an intersection cut lens
Liding Xu, Leo Liberti
We study a mixed-integer set arising in the submodular maximization problem, where is a submodular function defined o…
Cutting planes for signomial programming
Liding Xu, Claudia D'Ambrosio, Leo Liberti +1
Cutting planes are of crucial importance when solving nonconvex nonlinear programs to global optimality, for example using the spatial branch-and-bound algorithms. In this paper, w…