An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759)
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: An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics |
scientific article; zbMATH DE number 7039194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics |
scientific article; zbMATH DE number 7039194 |
Statements
An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (English)
0 references
20 March 2019
0 references
combinatorial optimization
0 references
branch-and-bound
0 references
evolutionary computations
0 references
metaheuristics
0 references
multi-objective programming
0 references
multi-dimensional knapsack problems
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8588241934776306
0 references
0.8298717737197876
0 references
0.8086422681808472
0 references
0.8086284399032593
0 references
0.7899901866912842
0 references
