Author:
Cao Jie,Yin Baoqun,Lu Xiaonong,Kang Yu,Chen Xin
Funder
National Natural Science Foundation of China
Doctoral Program of Higher Education of China
Fundamental Research Funds for the Central Universities
Publisher
Springer Science and Business Media LLC
Reference44 articles.
1. Bansal JC, Deep K (2012) A modified binary particle swarm optimization for knapsack problems. Appl Math Comput 218(22):11:042–11:061
2. Bas E (2011) A capital budgeting problem for preventing workplace mobbing by using analytic hierarchy process and fuzzy 0–1 bidimensional knapsack model. Expert Systems with Applications 38(10):12:415–12:422
3. Billionnet A, Soutif É (2004) An exact method based on lagrangian decomposition for the 0–1 quadratic knapsack problem. Eur J Oper Res 157(3):565–575
4. Chaharsooghi SK, Kermani AHM (2008) An intelligent multi-colony multi-objective ant colony optimization (aco) for the 0–1 knapsack problem. In: IEEE congress on evolutionary computation, 2008. CEC 2008. (IEEE world congress on computational intelligence). IEEE, pp 1195–1202
5. Chen S, Gao C, Li X, Lu Y, Zhang Z (2015) A rank-based ant system algorithm for solving 0/1 knapsack problem. J Comput Inf Syst 11(20):7423–7430
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献