Sentence examples for multidimensional knapsack problem from inspiring English sources

This paper investigates the problem reduction heuristic for the Multidimensional Knapsack Problem (MKP).

This paper introduces new problem-size reduction heuristics for the multidimensional knapsack problem.

The paper proposes a new ant colony optimization (ACO) approach, called binary ant system (BAS), to multidimensional Knapsack problem (MKP).

This paper presents an improved fruit fly optimization algorithm (IFFOA) for solving the multidimensional knapsack problem (MKP).

The multidimensional knapsack problem (MKP) is known to be NP-hard in operations research and it has a wide range of applications in engineering and management.

In this paper, an effective hybrid algorithm based on estimation of distribution algorithm (EDA) is proposed to solve the multidimensional knapsack problem (MKP).

This study presents an effective hybrid algorithm based on harmony search (HHS) for solving multidimensional knapsack problems (MKPs).

We reduce the problem to a multi-dimensional knapsack problem.

At first, by using a surrogate multiplier, the multidimensional nonlinear knapsack problem is translated into an one-dimensional nonlinear knapsack problem, which is called the surrogate problem.

Also, conventional fast search techniques for solving the multidimensional, multichoice knapsack problem can be applied to estimate with reasonable results.

This problem is then formulated as a multidimensional multichoice knapsack problem (MMKP) to maximize the total achieved throughput in the network.