An integer linear programming approach for bilinear integer programming
| Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
|---|---|
| Data(s) |
07/11/2013
07/11/2013
2012
|
| Resumo |
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. ANILLO ANILLO [ACT-88] CAPES CAPES |
| Identificador |
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 |
| Idioma(s) |
eng |
| Publicador |
ELSEVIER SCIENCE BV AMSTERDAM |
| Relação |
OPERATIONS RESEARCH LETTERS |
| Direitos |
restrictedAccess Copyright ELSEVIER SCIENCE BV |
| Palavras-Chave | #BILINEAR PROGRAMMING #INTEGER LINEAR PROGRAMMING #PRODUCT BUNDLING #PRODUCTS #OPERATIONS RESEARCH & MANAGEMENT SCIENCE |
| Tipo |
article original article publishedVersion |
