A new upper bound for the 0-1 quadratic knapsack problem (Q1806683): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00414-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057884923 / rank | |||
Normal rank | |||
Latest revision as of 09:21, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound for the 0-1 quadratic knapsack problem |
scientific article |
Statements
A new upper bound for the 0-1 quadratic knapsack problem (English)
0 references
8 November 1999
0 references
quadratic programming
0 references
0-1 quadratic knapsack problem
0 references
quadratic pseudo-Boolean function
0 references
Lagrangian decomposition
0 references
upper bound
0 references
computational experiments
0 references
0 references
