Solving 0-1 knapsack problem by greedy degree and expectation efficiency

Open Webpage

Jianhui Lv, Xingwei Wang, Min Huang, Hui Cheng, Fuliang Li

Published: 2016, Last Modified: 06 Mar 2025Appl. Soft Comput. 2016EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•The idea based on region partition of items for solving 0-1 knapsack problem.•Greedy degree algorithm for putting some items into knapsack early.•Dynamic expectation efficiency model for obtaining the candidate objective function value.•Static expectation efficiency model for updating the objective function value.•The proposed algorithm in this paper has correctness, feasibility, effectiveness, and stability.