Solving 0-1 knapsack problem by greedy degree and expectation efficiency
详细信息 查看全文
- 作者：Jianhui Lva ; lvjianhui2012@163.com" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Xingwei Wanga ; wangxw@mail.neu.edu.cn" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Min Huangb ; mhuang@mail.neu.edu.cn" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Hui Chengc ; H.Cheng@ljmu.ac.uk" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Fuliang Lia ; lifuliang207@126.com" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae
- 关键词：Economics ; Region partition ; Greedy degree ; Expectation efficiency ; Parallel computing
- 刊名：Applied Soft Computing
- 出版年：2016
- 出版时间：April 2016
- 年：2016
- 卷：41
- 期：Complete
- 页码：94-103
- 全文大小：1208 K
文摘
- •
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.