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): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: MEMOTS / rank | |||
Normal rank |
Revision as of 06:50, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
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 |
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