Title of article
A competitive local search heuristic for the subset sum problem
Author/Authors
Diptesh Ghosh، نويسنده , , Nilotpal Chakravarti، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1999
Pages
9
From page
271
To page
279
Abstract
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.
Keywords
Subset sum , Local search , Heuristics
Journal title
Computers and Operations Research
Serial Year
1999
Journal title
Computers and Operations Research
Record number
927002
Link To Document