| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 474298 | Computers & Operations Research | 2006 | 15 Pages |
Abstract
This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack Problem (MMKP), a variant of the classical 0–1 Knapsack Problem. We apply a transformation technique to map the multidimensional resource consumption to single dimension. Convex hulls are constructed to reduce the search space to find the near-optimal solution of the MMKP. We present the computational complexity of solving the MMKP using this approach. A comparative analysis of different heuristics for solving the MMKP has been presented based on the experimental results.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Md Mostofa Akbar, M. Sohel Rahman, M. Kaykobad, E.G. Manning, G.C. Shoja,