An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930)
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: An approximate dynamic programming approach to convex quadratic knapsack problems |
scientific article; zbMATH DE number 2211042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximate dynamic programming approach to convex quadratic knapsack problems |
scientific article; zbMATH DE number 2211042 |
Statements
An approximate dynamic programming approach to convex quadratic knapsack problems (English)
0 references
29 September 2005
0 references
approximate dynamic programming
0 references
quadratic knapsack problem
0 references
heuristics
0 references
0 references
0.8390282392501831
0 references
0.8263290524482727
0 references
0.8145727515220642
0 references
0.7817968726158142
0 references
0.777834951877594
0 references
