Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic improvements on dynamic programming for the bi-objective \0,1\ knapsack problem |
scientific article; zbMATH DE number 6201601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem |
scientific article; zbMATH DE number 6201601 |
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
0 references
0 references
0.8637784123420715
0 references
0.8603596687316895
0 references
0.8441953063011169
0 references
0.8421189785003662
0 references
0.8326190710067749
0 references
