Cite
Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem.
MLA
Feng, Yanhong, et al. “Multi-Strategy Monarch Butterfly Optimization Algorithm for Discounted {0-1} Knapsack Problem.” Neural Computing & Applications, vol. 30, no. 10, Nov. 2018, pp. 3019–36. EBSCOhost, https://doi.org/10.1007/s00521-017-2903-1.
APA
Feng, Y., Wang, G.-G., Li, W., & Li, N. (2018). Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem. Neural Computing & Applications, 30(10), 3019–3036. https://doi.org/10.1007/s00521-017-2903-1
Chicago
Feng, Yanhong, Gai-Ge Wang, Wenbin Li, and Ning Li. 2018. “Multi-Strategy Monarch Butterfly Optimization Algorithm for Discounted {0-1} Knapsack Problem.” Neural Computing & Applications 30 (10): 3019–36. doi:10.1007/s00521-017-2903-1.