Publisher
Springer Nature Singapore
Reference17 articles.
1. KNAPSACK_01 data for the 01 knapsack problem. https://people.sc.fsu.edu/~jburkardt/datasets/knapsack_01/knapsack_01.html. Accessed 17 Aug 2014
2. Ali, I.M., Essam, D., Kasmarik, K.: An efficient differential evolution algorithm for solving 0–1 knapsack problems. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2018)
3. Alomoush, A., Alsewari, A.A., Alamri, H.S., Zamli, K.Z.: Solving 0/1 knapsack problem using hybrid HS and Jaya algorithms. Adv. Sci. Lett. 24(10), 7486–7489 (2018)
4. David, D., Ronny, R., Widayanti, T., et al.: Modification of attractiveness and movement of the firefly algorithm for resolution to knapsack problems. In: 2022 4th International Conference on Cybernetics and Intelligent System (ICORIS), pp. 1–5. IEEE (2022)
5. Lecture Notes in Computer Science;W Korani,2020