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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
