1 citations · 3 across the 9 of their papers we have counts for
3 papers · 2 filters
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…
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…
Continuous Covering on Networks: Improved Mixed Integer Programming Formulations
Mercedes Pelegrín, Liding Xu
Covering problems are well-studied in the domain of Operations Research, and, more specifically, in Location Science. When the location space is a network, the most frequent assump…