Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:56, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core |
scientific article |
Statements
Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (English)
0 references
18 December 2009
0 references
knapsack
0 references
multi-dimensional
0 references
multi-objective programming
0 references
core
0 references
numerical examples
0 references
divide and conquer
0 references
multi-objective multi-dimensional knapsack problem
0 references
integer programming
0 references
multicriteria branch and bound algorithm
0 references
Pareto set
0 references
