Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q297301 |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Knapsack / rank | |||
Normal rank |
Revision as of 01:58, 28 February 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