Author:
Hassan Said Ali,Agrawal Prachi,Ganesh Talari,Mohamed Ali Wagdy
Publisher
Springer International Publishing
Reference55 articles.
1. Agrawal, P., Ganesh, T., & Mohamed, A. W. (2021). A novel binary gaining–sharing knowledge-based optimization algorithm for feature selection. Neural Computing and Applications, 33(11), 5989–6008.
2. Agrawal, P., Ganesh, T., & Mohamed, A. W. (2022). Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm. Complex & Intelligent Systems, 8(1), 43–63.
3. Anily, S., & Mosheiov, G. (1994). The traveling salesman problem with delivery and backhauls. Operations Research Letters, 16(1), 11–18.
4. Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2006). The traveling salesman problem. Princeton Series in Applied Mathematics (pp. 1–5). Princeton University Press.
5. Applegate, D. L., Bixby, R. E., Chvátal, V., Cook, W., Espinoza, D. G., Goycoolea, M., & Helsgaun, K. (2009). Certification of an optimal TSP tour through 85,900 cities. Operations Research Letters, 37(1), 11–15.