An improved balanced algorithm for the subset-sum problem

DOI10.1016/j.ejor.2018.11.055zbMath1430.90479OpenAlexW2901464676WikidataQ128880629 ScholiaQ128880629MaRDI QIDQ1713739

V. V. Curtis, Carlos Alberto Alonso Sanches

Publication date: 28 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.11.055

zbMATH Keywords

NP-hard problemcomputing sciencesubset-sum problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (2)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ ON BINARY SOLUTIONS TO SYSTEMS OF EQUATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
• Parallel time and space upper-bounds for the subset-sum problem
• Improved low-density subset sum algorithms
• Dynamic programming on the word RAM
• A low-space algorithm for the subset-sum problem on GPU
• Solving low-density subset sum problems
• Computing Partitions with Applications to the Knapsack Problem
• A Faster Pseudopolynomial Time Algorithm for Subset Sum
• A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
• An exact algorithm for the subset sum problem

This page was built for publication: An improved balanced algorithm for the subset-sum problem