A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.camwa.2011.07.067 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.CAMWA.2011.07.067 / rank | |||
Normal rank | |||
Latest revision as of 00:17, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem |
scientific article |
Statements
A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (English)
0 references
21 February 2012
0 references
bi-objective knapsack instances
0 references
multi-objective optimization
0 references
dynamic programming
0 references
state reduction
0 references
0 references
