.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Computing science
Subset-sum problem
NP-hard problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W