Application of 0–1 knapsack MPI + OpenMP hybrid programming algorithm at MH method

The paper aims at the problem that is 0–1 knapsack algorithm used to MH method, analyzes several kinds of method of the 0–1 knapsack, and puts forward the MPI + OpenMP optimal hybrid programming model which is used to this application. The experimental results show that the hybrid programming model is an effective method to solve this problem.