An integer linear programming approach for a class of bilinear integer programs

DOI10.1016/j.orl.2014.03.002zbMath1408.90197OpenAlexW2160856614MaRDI QIDQ1785220

Wee Peng Tay, Wuhua Hu

Publication date: 28 September 2018

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

Full work available at URL: http://hdl.handle.net/10220/19643

zbMATH Keywords

bipartite graphinteger linear programminginteger quadratic programmingbilinear integer programmingbinary binary linearizationbinary integer linearization

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Quadratic programming (90C20)

Uses Software

• YALMIP

Cites Work

• An integer linear programming approach for bilinear integer programming
• Solving Mixed Integer Bilinear Problems Using MILP Formulations
• The MILP Road to MIQCP
• Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
• Linear Reformulations of Integer Quadratic Programs
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

This page was built for publication: An integer linear programming approach for a class of bilinear integer programs