A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (Q2883573): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2010.05.035 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984447857 / rank | |||
Normal rank | |||
Revision as of 21:24, 19 March 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
