a IME - Universidade de São Paulo, São Paulo, Brazil
b Faculty of Engineering and Science, Universidad Adolfo Ibañez, Santiago, Chile
c Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, PA 15261, United States
Abstract:
We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear IP. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems.