APA-Zitierstil (7. Ausg.)

Feng, Y., Wang, G., Deb, S., Lu, M., & Zhao, X. (2017). Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization. Neural computing & applications, 28(7), 1619-1634. https://doi.org/10.1007/s00521-015-2135-1

Chicago-Zitierstil (17. Ausg.)

Feng, Yanhong, Gai-Ge Wang, Suash Deb, Mei Lu, und Xiang-Jun Zhao. "Solving 0–1 Knapsack Problem by a Novel Binary Monarch Butterfly Optimization." Neural Computing & Applications 28, no. 7 (2017): 1619-1634. https://doi.org/10.1007/s00521-015-2135-1.

MLA-Zitierstil (9. Ausg.)

Feng, Yanhong, et al. "Solving 0–1 Knapsack Problem by a Novel Binary Monarch Butterfly Optimization." Neural Computing & Applications, vol. 28, no. 7, 2017, pp. 1619-1634, https://doi.org/10.1007/s00521-015-2135-1.