Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem

被引：18
|
作者：
Della Croce, F. [2 ]
Grosso, A. [1 ]
机构：
[1] Univ Turin, DI, Turin, Italy
[2] Politecn Torino, DAI, Turin, Italy
来源：
COMPUTERS & OPERATIONS RESEARCH | 2012年 / 39卷 / 01期
关键词：
Multi-dimensional knapsack problem; Core problem; Partial enumeration; ALGORITHM;
D O I：
10.1016/j.cor.2011.03.013
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We consider the 0/1 multi-dimensional knapsack problem and discuss the performances of a new heuristic procedure particularly suitable for a parallel computing environment embedding core problem approaches and a branching scheme based on reduced costs of the corresponding LP relaxation solution value. The proposed approach compared favorably to the recent state of the art procedures available in the literature on the well known OR-Library multi-dimensional knapsack problem benchmarks instances. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码：27 / 31
页数：5
相关论文
共 50 条
12345