Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:15, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming algorithms for the bi-objective integer knapsack problem |
scientific article |
Statements
Dynamic programming algorithms for the bi-objective integer knapsack problem (English)
0 references
23 June 2016
0 references
multi-objective optimization
0 references
integer knapsack problems
0 references
dynamic programming
0 references
bound sets
0 references
