Tawanda’s allocation method for the 0-1 knapsack problem

Authors

  • Trust Tawanda Department of Applied Mathematics-Operations Research and Statistics, National University of Science and Technology, PO Box AC 939, Ascot, Bulawayo, Zimbabwe

Keywords:

Knapsack; Allocation; Optimal

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.

Published

2013-04-28

How to Cite

Tawanda, T. . (2013). Tawanda’s allocation method for the 0-1 knapsack problem. Scientific Journal of Pure and Applied Sciences, 2(4), 190-195. Retrieved from http://sjournals.com/index.php/sjpas/article/view/979

Issue

Section

Mathematics