| Article ID: | iaor20001733 |
| Country: | United Kingdom |
| Volume: | 26 |
| Issue: | 3 |
| Start Page Number: | 271 |
| End Page Number: | 279 |
| Publication Date: | Mar 1999 |
| Journal: | Computers and Operations Research |
| Authors: | Chakravarti Nilotpal, Ghosh Diptesh |
| Keywords: | programming: integer |
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.