A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
0-1 Knapsack Problem (KP01) is a classical NP-hard problem and it plays an important role in real-world applications. In this paper, we propose a heuristic algorithm based on Expectation Efficiency, Increasing rate of profit and Improved greedy strategy (EEII) to get approximate solution of KP01. (i) Some items are selected with greedy strategy and put into knapsack. (ii) We propose expectation efficiency strategy and increasing rate of profit strategy to determine which items are loaded intodoi:10.24507/ijicic.14.05.1833 fatcat:op6i7rijafgttd6kjn6hjvyik4