Abstract
The objective function and constraint of the knapsack problem are aggregated and an equivalent knapsack problem is formed. The equivalent problem is solved in a new algorithm as a dynamic programming recursion. This new formulation then leads to a solution of the knapsack problem by the corner polyhedron and group knapsack approaches. The result is a second algorithm that differs from current algorithms and may have certain computational advantages over them.
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.
