A CONIC APPROXIMATION METHOD FOR THE 0-1 QUADRATIC KNAPSACK PROBLEM

被引：6

作者：

Zhou, Jing ^{[1
]}

Chen, Dejun ^{[1
]}

Wang, Zhenbo ^{[1
]}

Xing, Wenxun ^{[1
]}

机构：

[1] Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China

来源：

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION | 2013年 / 9卷 / 03期

基金：

中国国家自然科学基金;

关键词：

0-1 quadratic knapsack problem; nonnegative quadratic function cone; conic approximation; MAXIMAL CLIQUE PROBLEM; PROGRAMMING PROBLEMS; DUALITY;

D O I：

10.3934/jimo.2013.9.531

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper solves the 0-1 quadratic knapsack problem using a conic approximation method. We propose a nonnegative quadratic function cone program to equivalently represent the problem. Based on the technique of linear matrix inequality, we present an adaptive approximation scheme to obtain a global optimal solution or lower bound for the problem by using computable cones. Some computational examples are provided to show the effectiveness of the proposed method.

引用

页码：531 / 547

页数：17

共 50 条

[1] Lagrangean methods for the 0-1 Quadratic Knapsack Problem
Michelon, P
Veilleux, L
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 92 (02) : 326 - 341
[2] Linear programming for the 0-1 quadratic knapsack problem
Billionnet, A
Calmels, F
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 92 (02) : 310 - 325
[3] An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
Billionnet, A
Soutif, T
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 157 (03) : 565 - 575
[4] Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
Letocart, Lucas
Nagih, Anass
Plateau, Gerard
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 12 - 18
[5] A matheuristic for the 0-1 generalized quadratic multiple knapsack problem
Adouani, Yassine
Jarboui, Bassem
Masmoudi, Malek
[J]. OPTIMIZATION LETTERS, 2022, 16 (01) : 37 - 58
[6] A new upper bound for the 0-1 quadratic knapsack problem
Billionnet, A
Faye, A
Soutif, É
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (03) : 664 - 672
[7] The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem
Yingjie Liu
[J]. Theory of Computing Systems, 2002, 35 : 559 - 564
[8] The fully polynomial approximation algorithm for the 0-1 knapsack problem
Liu, YJ
[J]. THEORY OF COMPUTING SYSTEMS, 2002, 35 (05) : 559 - 564
[9] The quadratic 0-1 knapsack problem with series-parallel support
Rader, DJ
Woeginger, GJ
[J]. OPERATIONS RESEARCH LETTERS, 2002, 30 (03) : 159 - 166
[10] An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
Yang, Zhen
Wang, Guoqing
Chu, Feng
[J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (05) : 1176 - 1185

← 1 2 3 4 5 →