Article ID Journal Published Year Pages File Type
7543939 Operations Research Letters 2017 6 Pages PDF
Abstract
In the literature on the quadratic 0-1 knapsack problem, several alternative ways have been given to represent the knapsack constraint in the quadratic space. We extend this work by constructing analogous representations for arbitrary linear inequalities for arbitrary non-convex mixed-integer quadratic programs with bounded variables.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,