Article ID Journal Published Year Pages File Type
1143036 Operations Research Letters 2012 4 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
An integer linear programming approach for bilinear integer programming
Authors
, , ,