Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem

Algorithm 1

Approximate solution to (E-kKP).

	Step 1: Obtain the neighborhood by (20), h = 1, 2, 3, 4.
	Step 2: Calculate the objective value of feasible solution in by equation as follows:
	Step 3: Obtain the best solution in by (Algorithm 1).