A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206): 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.camwa.2011.07.067 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985999411 / rank | |||
Normal rank | |||
Revision as of 00:26, 20 March 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
