An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2004.07.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992916292 / rank | |||
Normal rank | |||
Revision as of 23:20, 19 March 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
