An improved balanced algorithm for the subset-sum problem

V.V. Curtis and C.A.A. Sanches

European Journal of Operational Research, 2019, vol. 275, issue 2, 460-466

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(n2wmax) and space O(n+wmax), where wmax is the largest of n items, has obtained excellent performance in comparison to other known algorithms.

Keywords: Computing science; Subset-sum problem; NP-hard problem (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221718309962
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:275:y:2019:i:2:p:460-466

DOI: 10.1016/j.ejor.2018.11.055

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().