In this paper, a new outer space rectangle branch and bound algorithm is proposed for globally solving generalized affine multiplicative programming problem. By applying the equivalent transformations ...

By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for ...

The way you formulate your integer programming problem can have a significant impact on the algorithm performance. You should try to minimize the number of variables and constraints, use tight ...