An integer linear programming approach for bilinear integer programming

DOI10.1016/j.orl.2011.12.004zbMath1242.90109OpenAlexW2080818485WikidataQ57707472 ScholiaQ57707472MaRDI QIDQ435736

Eduardo Moreno, Juan Pablo Vielma, Alexandre S. Freire

Publication date: 12 July 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.12.004

zbMATH Keywords

bilinear programminginteger linear programmingproduct bundling

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (3)

A note on linearized reformulations for a class of bilevel linear integer problems ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ An integer linear programming approach for a class of bilinear integer programs

Cites Work

• Unnamed Item
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• Bundling retail products: models and analysis
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Integer programming formulation of combinatorial optimization problems
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• Branching and bounds tighteningtechniques for non-convex MINLP
• Jointly Constrained Biconvex Programming

This page was built for publication: An integer linear programming approach for bilinear integer programming