An iterated “hyperplane exploration” approach for the quadratic knapsack problem
详细信息 查看全文
- 作者：Yuning Chena ; yuning@info.univ-angers.fr" class="auth_mail" title="E-mail the corresponding author ; Jin-Kao Haoa ; b ; hao@info.univ-angers.fr" class="auth_mail" title="E-mail the corresponding author
- 关键词：Quadratic knapsack problem ; Hyperplane exploration ; Tabu search ; Variable fixing ; Heuristics
- 刊名：Computers and Operations Research
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：77
- 期：Complete
- 页码：226-239
- 全文大小：689 K
文摘
- •
The quadratic knapsack problem (QKP) is a well-known optimization problem.
- •
A hyperplane constraint is introduced to obtain a reduced model of the original problem.
- •
A variable fixing strategy is employed to further reduce the search space.
- •
A dedicated tabu search procedure explores the hyperplane constrained subproblem.
- •
Computational results and comparisons are shown on three sets of 220 benchmark instances.