Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382): 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.1007/s10589-013-9551-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020127609 / rank | |||
Normal rank | |||
Revision as of 20:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem |
scientific article |
Statements
Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (English)
0 references
26 August 2013
0 references
bi-objective \{0,1\} knapsack problems
0 references
multi-objective combinatorial optimization
0 references
bounds sets
0 references
dichotomic search
0 references
bi-objective simplex algorithm
0 references
