An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q113310220, #quickstatements; #temporary_batch_1705917335470 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:35, 8 February 2024
scientific article; zbMATH DE number 6738143
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem |
scientific article; zbMATH DE number 6738143 |
Statements
An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (English)
0 references
30 June 2017
0 references
continuous quadratic knapsack
0 references
convex programming
0 references
heap
0 references
nonlinear programming
0 references
quadratic programming
0 references
separable programming
0 references
