An integer linear programming approach for bilinear integer programming

Alexandre S. Freire, Eduardo Moreno, Juan Pablo Vielma

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


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.

Original languageEnglish
Pages (from-to)74-77
Number of pages4
JournalOperations Research Letters
Issue number2
StatePublished - Mar 2012


  • Bilinear programming
  • Integer linear programming
  • Product bundling


Dive into the research topics of 'An integer linear programming approach for bilinear integer programming'. Together they form a unique fingerprint.

Cite this