Dec 1, 2009 · This paper deals with the bi-objective multi-dimensional knapsack problem. We propose the adaptation of the core concept that is effectively ...
This paper discusses the bi-objective multi-dimensional knapsack problem. We propose the refinement of the core concept that has already effectively been ...
This paper deals with the bi-objective multi-dimensional knapsack problem. We propose the adaptation of the core concept that is effectively used in ...
Jan 5, 2021 · This paper discusses the bi-objective multi-dimensional knapsack problem. We propose the refinement of the core concept that has already ...
Problem solving, en. dc.title, Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core, en. heal.type, journalArticle, en.
People also ask
What is the core concept for the multidimensional knapsack problem?
The main idea is to reduce the original problem by only considering a core of items for which it is hard to decide if they will occur in an optimal solution or not, whereas the variables for all items outside the core are fixed to certain values.
What is the multi objective knapsack problem?
Multi-objective knapsack problem
Instead of one objective, such as maximizing the monetary profit, the objective could have several dimensions. For example, there could be environmental or social concerns as well as economic goals.
What is the multidimensional multiple choice knapsack problem?
The multiple-choice multidimensional knapsack problem (MMKP) assumes n sets composed of mutually exclusive items. The goal is to select exactly one item per set, maximizing the overall utility, without violating a family of knapsack constraints.
What is the main objective of the knapsack problem?
The aim of the knapsack problem is to maximize the total value of items that can be placed in a knapsack, given a certain capacity constraint. The aim of the knapsack problem is to maximize the total profit of selected items while respecting the knapsack capacity constraint.
May 9, 2010 · We propose a methodology for obtaining the exact Pareto set of Bi-Objective Multi-Dimensional Knapsack Problems, exploiting the concept of core
This method, proposed by Ulungu and Teghem (1995), was initially used to solve biobjective. CO problems. The first phase generates the set XSE of supported ...
This paper deals with the bi-objective multi-dimensional knapsack problem. We propose the adaptation of the core concept that is effectively used in single- ...
Such method, proposed by Ulungu and Teghem [78], is initially dedicated to solve biobjective CO problems. The first phase generates the set XSE of supported ...
We propose a methodology for obtaining the exact Pareto set of Bi-Objective Multi-Dimensional Knapsack Problems, exploiting the concept of core expansion.