APA (7th ed.) Citation

Feng, Y., Yang, J., Wu, C., Lu, M., & Zhao, X. (2018). Solving 0–1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation. Memetic computing, 10(2), 135-150. https://doi.org/10.1007/s12293-016-0211-4

Chicago Style (17th ed.) Citation

Feng, Yanhong, Juan Yang, Congcong Wu, Mei Lu, and Xiang-Jun Zhao. "Solving 0–1 Knapsack Problems by Chaotic Monarch Butterfly Optimization Algorithm with Gaussian Mutation." Memetic Computing 10, no. 2 (2018): 135-150. https://doi.org/10.1007/s12293-016-0211-4.

MLA (9th ed.) Citation

Feng, Yanhong, et al. "Solving 0–1 Knapsack Problems by Chaotic Monarch Butterfly Optimization Algorithm with Gaussian Mutation." Memetic Computing, vol. 10, no. 2, 2018, pp. 135-150, https://doi.org/10.1007/s12293-016-0211-4.