A competitive local search heuristic for the subset sum problem

Subset sum problems are a special class of difficult singly constrained zero–one integer programming problems. Several heuristics for solving these problems have been reported in the literature. In this paper we propose a new heuristic based on local search which improves upon the previous best.