A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We address nonconvex mixed-integer bilinear problems where the main challenge is the computation of a tight upper bound for the objective function to be maximized. This can be obtained by using the recently developed concept of multiparametric disaggregation following the solution of a mixed-integer linear relaxation of the bilinear problem. Besides showing that it can provide better bounds than a commercial global optimization solver within a given computational time, we propose to also takedoi:10.1007/s10898-014-0162-6 fatcat:5cbgmc7e6zgtpmevftgxpsbhde