A new method for a multi-dimensional Knapsack problem

다차원(多次元) 배낭 문제의 새로운 해법(解法)

The objective of this paper is to present a new method for the multi-dimensional Knapsack problem. Toyoda method and Loulou and Michaelides method are well known for this problem. The new method introduces a new penalty factor for fast convergence and a branching technique for accurate solutions. The method is tested at IBM370 and shows that the method is slower than Toyoda method, but more accurate than other two methods.