A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (Q2883573)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming |
scientific article; zbMATH DE number 6033934
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming |
scientific article; zbMATH DE number 6033934 |
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
0.8719063
0 references
0.86783844
0 references
0.8645703
0 references
0.8580016
0 references
0.85795116
0 references
0.8562516
0 references
