.png){kind=icon}
返回
An improved balanced algorithm for the subset-sum problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2018.11.055.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present BalsubLast, which is an improved balanced algorithm for the Subset-Sum Problem that was designed to solve benchmarks that require the exhaustion of the search space and where there are many subsets with the same sum. This new algorithm, which spends time O(n(2)w(max)) and space O(n + w(max)), where wmax is the largest of n items, has obtained excellent performance in comparison to other known algorithms. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Computing science
Subset-sum problem
NP-hard problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
PREAI
分享收藏Relationship between Body Roundness Index and Risk of Type 2 Diabetes in Japanese Men and Women: A Reanalysis of a Cohort Study身体圆润度指数与日本男性和女性2型糖尿病风险的关系：一项队列研究的再分析
OAAI
OAAI分享收藏
查看更多内容