A dynamic programming heuristic for the quadratic knapsack problem (Q2967622)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6690597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming heuristic for the quadratic knapsack problem |
scientific article; zbMATH DE number 6690597 |
Statements
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (English)
0 references
1 March 2017
0 references
knapsack problems
0 references
integer programming
0 references
dynamic programming
0 references
0 references
0 references
0.8489847183227539
0 references
0.8388792872428894
0 references
0.831994891166687
0 references
0.8263290524482727
0 references
0.8238746523857117
0 references
