Tawanda’s allocation method for the 0-1 knapsack problem
Publish Year: 1392
Type: Journal paper
Language: English
View: 332
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
JR_SJPAS-2-4_003
Index date: 6 December 2015
Tawanda’s allocation method for the 0-1 knapsack problem abstract
In this paper, a new allocation method to solve the knapsack problems is developed and demonstrated. The method makes use of all possible item combinations to produce the optimal solution. The allocation method is divided into two sub - allocations procedures namely, the initial allocation procedure and the objective allocation procedure. Existence of combinations is determined by the initial allocation whereas the optimality of allocation is determined by the objective allocation. The method is capable of computing all possible solutions to the problem.
Tawanda’s allocation method for the 0-1 knapsack problem Keywords:
Tawanda’s allocation method for the 0-1 knapsack problem authors
t Tawanda
Department of Applied Mathematics-Operations Research and Statistics, National University of Science and Technology, PO Box AC ۹۳۹, Ascot, Bulawayo, Zimbabwe.