An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930): Difference between revisions
From MaRDI portal
Latest revision as of 16:01, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An approximate dynamic programming approach to convex quadratic knapsack problems |
scientific article |
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