.png){kind=icon}
返回
Linear programming for the 0-1 quadratic knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(94)00229-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we consider the quadratic knapsack problem which consists in maximizing a positive quadratic pseudo-Boolean function subject to a linear capacity constraint. We propose a new method for computing an upper bound. This method is based on the solution of a continuous linear program constructed by adding to a classical linearization of the problem some constraints redundant in 0-1 variables but nonredundant in continuous variables. The obtained upper bound is better than the bounds given by other known methods. We also propose an algorithm for computing a good feasible solution. This algorithm is an elaboration of the heuristic methods proposed by Chaillou, Hansen and Mahieu and by Gallo, Hammer and Simeone. The relative error between this feasible solution and the optimum solution is generally less than 1%. We show how these upper and lower bounds can be efficiently used to determine the values of some variables at the optimum. Finally we propose a branch-and-bound algorithm for solving the quadratic knapsack problem and report extensive computational tests.
Keyword:
zero-one quadratic programming
knapsack problem
linearization
branch-and-bound
computational analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Effect of hangebyakujutsutemmato on pregabalin‐induced dizziness in a rat model of neuropathic pain汉格比亚库吉特特马托对神经病理性疼痛大鼠模型中普瑞巴林诱导性眩晕的影响
PREAI
分享收藏
查看更多内容