.png){kind=icon}
返回
Lagrangean methods for the 0-1 Quadratic Knapsack Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(94)00286-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
It is well known that the Lagrangean decomposition provides better bounds than the Lagrangean relaxation does. Nevertheless, the Lagrangean decomposition bound is harder to compute than the Lagrangean relaxation bound. Thus, one might wonder what is the best Lagrangean method to use in a branch-and-bound algorithm. In this paper, we give an answer to such a question for the 0-1 Quadratic Knapsack Problem. We first study the Lagrangean decomposition for this problem and give new necessary optimality conditions for the dual problem which allow us to elaborate a heuristic method for solving the Lagrangean decomposition dual problem. We then introduce this method in Chaillou-Hansen-Mahieu's branch-and-bound algorithm where upper bounds were computed by Lagrangean relaxation.
Keyword:
nonlinear integer programming
Lagrangean methods
branch-and-bound algorithm
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
分享收藏分享收藏 没有更多内容
没有更多内容