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. Scope and purpose Subset sum problems (SSP) are a widely studied class of integer programming problems. These frequently occur as subproblems in other integer programs. They have been used for calculating bounds for general integer programs and power indices of players in cooperative voting games. In this paper we present a competitive heuristic for approximately solving this problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
