An integer linear programming approach for a class of bilinear integer programs
type: Item
instance of: scholarly article
title: An integer linear programming approach for a class of bilinear integer programs
zbMATH Open document ID: 1408.90197
author: Wuhua Hu
author: Wee Peng Tay
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
full work available at URL: http://hdl.handle.net/10220/19643
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6945255
zbMATH Keywords: bilinear integer programming
zbMATH Keywords: integer linear programming
zbMATH Keywords: integer quadratic programming
zbMATH Keywords: binary binary linearization
zbMATH Keywords: binary integer linearization
zbMATH Keywords: bipartite graph
describes a project that uses: YALMIP
MaRDI profile type: Publication
OpenAlex ID: W2160856614
cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
cites work: Linear Reformulations of Integer Quadratic Programs
cites work: The MILP Road to MIQCP
cites work: An integer linear programming approach for bilinear integer programming
cites work: Solving mixed integer bilinear problems using MILP formulations
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
DOI: 10.1016/J.ORL.2014.03.002
description: scientific article; zbMATH DE number 6945255