期刊
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING
卷 4, 期 4, 页码 434-449出版社
INDERSCIENCE ENTERPRISES LTD
DOI: 10.1504/EJIE.2010.035653
关键词
multidimensionnal knapsack problem; MKP; cooperative method; dynamic programming; branch and bound
This article presents an exact cooperative method for the solution of the multidimensional knapsack problem (MKP) which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the literature. Solution values of the first step are compared with optimal values and results provided by other well-known existing heuristics. Then, our exact cooperative method is compared with a classical branch and bound algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据