Abstract
This paper presents a new enumeration scheme to solve the one-dimensional knapsack problem motivated by some observations on number theory, more specifically on the determination of the number of solutions of linear diophantine equations. This new algorithm is pseudopolynomial and its special features provide a reduction in running time and in the computational memory requirements as compared with other exact (dynamic programming) methods.
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.
