| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Inst Tecnol Aeronaut, DCTA, IEC, Praca Mal Eduardo Gomes 50, BR-12228900 Sao Jose Dos Campos, SP - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | European Journal of Operational Research; v. 275, n. 2, p. 460-466, JUN 1 2019. |
| Web of Science Citations: | 1 |
| Abstract | |
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. (AU) | |
| FAPESP's process: | 15/18164-5 - Parallel solutions to intractable problems in industrial processes |
| Grantee: | Carlos Alberto Alonso Sanches |
| Support Opportunities: | Regular Research Grants |