An integer linear programming approach for bilinear integer programming

dc.creatorFreire, Alexandre da Silva
dc.creatorMoreno, Eduardo
dc.creatorVielma, Juan Pablo
dc.date.accessioned2013-11-07T10:08:49Z
dc.date.accessioned2018-07-04T16:22:19Z
dc.date.available2013-11-07T10:08:49Z
dc.date.available2018-07-04T16:22:19Z
dc.date.created2013-11-07T10:08:49Z
dc.date.issued2012
dc.identifierOPERATIONS RESEARCH LETTERS, AMSTERDAM, v. 40, n. 2, pp. 74-77, MAR, 2012
dc.identifier0167-6377
dc.identifierhttp://www.producao.usp.br/handle/BDPI/42832
dc.identifier10.1016/j.orl.2011.12.004
dc.identifierhttp://dx.doi.org/10.1016/j.orl.2011.12.004
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1634954
dc.description.abstractWe 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.
dc.languageeng
dc.publisherELSEVIER SCIENCE BV
dc.publisherAMSTERDAM
dc.relationOPERATIONS RESEARCH LETTERS
dc.rightsCopyright ELSEVIER SCIENCE BV
dc.rightsrestrictedAccess
dc.subjectBILINEAR PROGRAMMING
dc.subjectINTEGER LINEAR PROGRAMMING
dc.subjectPRODUCT BUNDLING
dc.titleAn integer linear programming approach for bilinear integer programming
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución