A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (Q2883573): Difference between revisions
From MaRDI portal
Latest revision as of 05:24, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming |
scientific article |
Statements
A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (English)
0 references
13 May 2012
0 references
integer quadratic programming
0 references
non separable function
0 references
linearization techniques
0 references
knapsack problems
0 references
0 references