.png){kind=icon}
返回
MINIMIZATION OF A QUADRATIC PSEUDO-BOOLEAN FUNCTION
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(94)90125-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a branch and bound algorithm for minimizing a quadratic pseudo-Boolean function f(x). At each node of the search tree the lower bound is computed in three phases and is equal to b1 + b2 + b3. Computation of b1 is based upon roof duality, b2 uses the characterization of some positive quadratic posiforms associated with the directed cycles of the implication graph of Aspvall, P Tarjan and b3 is computed by searching in a posiform of degree 4 some subfunctions which cannot be equal to zero. These subfunctions are found by using the notion of implication between literals. Computational results on several hundred test problems with up to 100 variables demonstrate the efficiency of this lower bound.
Keyword:
ZERO-ONE QUADRATIC PROGRAMMING
BRANCH AND BOUND
COMPUTATION
LOWER BOUND
MAXIMUM SATISFIABILITY
STABILITY NUMBER
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Enfermedad hemolítica del feto y del recién nacido por aloanticuerpos contra el antígeno M.png)
Biomédica
OAAI
BiomédicaIF0
OAAI分享收藏分享收藏Money in the Middle: Contribution Strategies among Affluent Donors to Federal Elections, 1980–2008
PREAI
分享收藏 没有更多内容
没有更多内容