Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419)
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: Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core |
scientific article; zbMATH DE number 5649899
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core |
scientific article; zbMATH DE number 5649899 |
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
0 references
0 references
0 references
0 references
