1 citations · 1 across the 2 of their papers we have counts for
3 papers · 1 filter
Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
Julio González-Díaz, Brais González-Rodríguez, Ignacio Gómez-Casares
In this paper we explore a relevant aspect of the interplay between two core elements of global optimization algorithms for nonconvex nonlinear programming problems, which we belie…
An extension of an RLT-based solver to MINLP polynomial problems
Julio González-Díaz, Brais González-Rodríguez, Iria Rodríguez-Acevedo
In this paper we extend the core branch-and-bound algorithm of an RLT-based solver for continuous polynomial optimization, RAPOSa, to handle mixed-integer problems. We do so by a d…
Learning for Spatial Branching: An Algorithm Selection Approach
Bissan Ghaddar, Ignacio Gómez-Casares, Julio González-Díaz +3
The use of machine learning techniques to improve the performance of branch-and-bound optimization algorithms is a very active area in the context of mixed integer linear problems,…