An integer linear programming approach for bilinear integer programming

Alexandre S. Freire; Eduardo Moreno; Juan Pablo Vielma

doi:10.1016/j.orl.2011.12.004

An integer linear programming approach for bilinear integer programming

Alexandre S. Freire, Eduardo Moreno, Juan Pablo Vielma

Faculty of Engineering and Science

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

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.

Original language	English
Pages (from-to)	74-77
Number of pages	4
Journal	Operations Research Letters
Volume	40
Issue number	2
DOIs	https://doi.org/10.1016/j.orl.2011.12.004
State	Published - Mar 2012

Keywords

Bilinear programming
Integer linear programming
Product bundling

Access to Document

10.1016/j.orl.2011.12.004

Cite this

@article{ac8212d33c864341979f81ddfc6d4a27,

title = "An integer linear programming approach for bilinear integer programming",

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 = "Bilinear programming, Integer linear programming, Product bundling",

author = "Freire, {Alexandre S.} and Eduardo Moreno and Vielma, {Juan Pablo}",

note = "Funding Information: This work was partially funded by project ANILLO ACT-88 (E.M.) and CAPES (A.F.) . The authors would also like to thank an anonymous referee for some helpful comments that significantly improved the presentation of the paper.",

year = "2012",

month = mar,

doi = "10.1016/j.orl.2011.12.004",

language = "English",

volume = "40",

pages = "74--77",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - An integer linear programming approach for bilinear integer programming

AU - Freire, Alexandre S.

AU - Moreno, Eduardo

AU - Vielma, Juan Pablo

N1 - Funding Information: This work was partially funded by project ANILLO ACT-88 (E.M.) and CAPES (A.F.) . The authors would also like to thank an anonymous referee for some helpful comments that significantly improved the presentation of the paper.

PY - 2012/3

Y1 - 2012/3

N2 - 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.

AB - 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.

KW - Bilinear programming

KW - Integer linear programming

KW - Product bundling

UR - http://www.scopus.com/inward/record.url?scp=84856614278&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2011.12.004

DO - 10.1016/j.orl.2011.12.004

M3 - Article

AN - SCOPUS:84856614278

SN - 0167-6377

VL - 40

SP - 74

EP - 77

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

An integer linear programming approach for bilinear integer programming

Abstract

Keywords

Access to Document

Fingerprint

Cite this