An integer linear programming approach for bilinear integer programming

Freire, Alexandre da Silva; Moreno, Eduardo; Vielma, Juan Pablo

Artículos de revistas

Date

2012

Registration in:

OPERATIONS RESEARCH LETTERS, AMSTERDAM, v. 40, n. 2, pp. 74-77, MAR, 2012

0167-6377

http://www.producao.usp.br/handle/BDPI/42832

10.1016/j.orl.2011.12.004

http://dx.doi.org/10.1016/j.orl.2011.12.004

http://repositorioslatinoamericanos.uchile.cl/handle/2250/1634954

Author

Freire, Alexandre da Silva

Moreno, Eduardo

Vielma, Juan Pablo

Institutions

Universidade de São Paulo (Brasil)

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 P. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems. (C) 2011 Elsevier B.V. All rights reserved.

Subjects

BILINEAR PROGRAMMING

INTEGER LINEAR PROGRAMMING

PRODUCT BUNDLING

Show full item record