5 citations · 16 across the 10 of their papers we have counts for
3 papers · 1 filter
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…
Comparing perspective reformulations for piecewise-convex optimization
Renan Spencer Trindade, Claudia D'Ambrosio, Antonio Frangioni +1
Our study is motivated by the solution of Mixed-Integer Non-Linear Programming (MINLP) problems with separable non-convex functions via the Sequential Convex MINLP technique, an it…
Branch and Price for Submodular Bin Packing
Liding Xu, Claudia D'Ambrosio, Sonia Haddad Vanier +1
The Submodular Bin Packing (SMBP) problem asks for packing unsplittable items into a minimal number of bins for which the capacity utilization function is submodular. SMBP is equiv…