[1] |
HAO Xiang, HE Yichao, ZHU Xiaobin, ZHAI Qinglei.
Discrete Hybrid Multi-verse Optimization Algorithm for Solving Discounted {0-1} Knapsack Problem
[J]. Computer Engineering and Applications, 2021, 57(18): 103-113.
|
[2] |
ZHANG Ming, DENG Wenhan, LIN Juan, ZHONG Yiwen.
Modified Ant Colony Optimization Algorithm for Discounted {0-1} Knapsack Problem
[J]. Computer Engineering and Applications, 2021, 57(13): 85-95.
|
[3] |
WU Congcong, HE Yichao, ZHAO Jianli.
New Genetic Algorithm for Discounted {0-1} Knapsack Problem
[J]. Computer Engineering and Applications, 2020, 56(7): 57-66.
|
[4] |
CHEN Changqian, MU Xiaodong, NIU Ben, WANG Lizhi.
Improved Binary Grey Wolves Optimization Algorithm Combined with Gaussian Distribution
[J]. Computer Engineering and Applications, 2019, 55(13): 145-150.
|
[5] |
YANG Yang1, PAN Dazhi1, HE Yichao2.
Improved repair strategy genetic algorithm solve discount {0-1} knapsack problem
[J]. Computer Engineering and Applications, 2018, 54(21): 37-42.
|
[6] |
LIU Xuejing, HE Yichao, WU Congcong, CAI Xiufeng.
Research on bacterial foraging optimization algorithm for discounted {0-1} knapsack problem
[J]. Computer Engineering and Applications, 2018, 54(2): 155-162.
|
[7] |
LIU Xuejing1, HE Yichao1, WU Congcong1, LI Liang2.
Adaptive bacterial foraging optimization algorithm for discounted {0-1} knapsack problem
[J]. Computer Engineering and Applications, 2018, 54(18): 139-146.
|
[8] |
LIU Xuejing1, HE Yichao1, WU Congcong1, LI Liang2.
Chaotic binary crow search algorithm for 0-1 knapsack problem
[J]. Computer Engineering and Applications, 2018, 54(10): 173-179.
|
[9] |
QIAN Xi, ZENG Cheng, WANG Tian.
Most stably continuous service set recommend algorithm in changing time
[J]. Computer Engineering and Applications, 2017, 53(10): 73-78.
|
[10] |
CUI Jianshuang, WANG Chongjing.
Solving multiple knapsack problem with speed limit particle swarm algorithm
[J]. Computer Engineering and Applications, 2015, 51(9): 244-247.
|
[11] |
WU Congcong, HE Yichao, CHEN Yiying, LIU Xuejing, CAI Xiufeng.
Binary bat algrorithm for solving 0-1 knapsack problem
[J]. Computer Engineering and Applications, 2015, 51(19): 71-74.
|
[12] |
YU Juan, HE Yuyao.
Hybrid algorithm based on Genetic Algorithm and estimation of distribution algorithm for 0-1 knapsack problem
[J]. Computer Engineering and Applications, 2014, 50(9): 12-16.
|
[13] |
WU Jiagao1, ZHANG Xi1, ZHUANG Songjie1, ZOU Zhiqiang1, HU Bin2.
Research on cache replacement strategy for space vector data of multi-layer
[J]. Computer Engineering and Applications, 2014, 50(7): 89-93.
|
[14] |
LI Zhiyong, MA Liang, ZHANG Huizhen.
Genetic mutation bat algorithm for 0-1 knapsack problem
[J]. Computer Engineering and Applications, 2014, 50(11): 49-52.
|
[15] |
WANG Na, XIANG Fenghong, MAO Jianlin.
Modified genetic ant colony hybrid algorithms for solving 0/1 knapsack problems
[J]. Computer Engineering and Applications, 2013, 49(9): 54-56.
|