期刊
COMPUTERS & OPERATIONS RESEARCH
卷 33, 期 5, 页码 1259-1273出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2004.09.016
关键词
algorithms; convex hull; heuristics; MMKP; multimedia systems
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. (c) 2004 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据