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

DOI10.1016/J.ORL.2014.03.002MaRDI QIDQ1785220zbMATH OpenOpenAlexFDO

Authors Wuhua Hu, Wee Peng Tay

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

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

Recommendations

• An integer linear programming approach for bilinear integer programming
• Solving mixed integer bilinear problems using MILP formulations
• A meta-control algorithm for generating approximate solutions to binary integer programming problems
• The integral basis method for integer programming
• A new reformulation-linearization technique for bilinear programming problems

Cites work

• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• An integer linear programming approach for bilinear integer programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Linear Reformulations of Integer Quadratic Programs
• Linear programming relaxations of quadratically constrained quadratic programs
• Solving mixed integer bilinear problems using MILP formulations
• The MILP road to MIQCP

Cited in

(6)

• A heuristic algorithm for solving integer linear programming problem and unveiling the applications
• Integer Linear Programming in Computational and Systems Biology
• An integer linear programming approach for bilinear integer programming
• An approach based on reliability-based possibility degree of interval for solving general interval bilevel linear programming problem
• scientific article; zbMATH DE number 5189377 (Why is no real title available?)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables

Describes a project that uses

Uses Software

• YALMIP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785220)