A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6466793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A reduction dynamic programming algorithm for the bi-objective integer knapsack problem |
scientific article; zbMATH DE number 6466793 |
Statements
A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (English)
0 references
28 July 2015
0 references
multi-objective programming
0 references
integer knapsack problem
0 references
dynamic programming
0 references
dominance relation
0 references
core concept
0 references
state reduction
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.911189615726471
0 references
0.9001157283782959
0 references
0.849901556968689
0 references
0.8326190710067749
0 references
0.821048378944397
0 references
