Title of article
Improved Weighted 0-1 Knapsack Method (WKM) to Optimize Resource Allocation
Author/Authors
alrawi, maha a. hammood university of technology - department of computer science, Iraq , ali, israa tahseen university of technology - department of computer science, Iraq , saied, olaa amer university of technology - department of computer science, Iraq
From page
309
To page
316
Abstract
In this paper an improved weighted 0-1 knapsack method (WKM) is proposed to optimize the resource allocation process when the sum of items weight exceeds the knapsack total capacity .The improved method depends on a modified weight for each item to ensure the allocation of the required resources for all the involved items. The results of the improved WKM are compared to the traditional 0-1 Knapsack Problem (KP). The proposed method dominates on the other one in term of the total optimal solution value of the knapsack .
Keywords
knapsack problem , dynamic programming , optimal solution , resource allocation.
Journal title
Iraqi Journal Of Science
Journal title
Iraqi Journal Of Science
Record number
2639685
Link To Document