1. Instances of 0/1 knapsack problem. http://artemisa.unicauca.edu.co/~johnyortega/instances_01_KP/
2. Abdul-Rahman, S., Yung, V.C.: Comparison of optimization and tabu search approach for solving capital budgeting based on knapsack problem (2019)
3. Amaral, P., Pais, T.C.: Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling. Comput. Oper. Res. 72, 160–174 (2016)
4. Assi, M., Haraty, R.A.: A survey of the knapsack problem. In: 2018 International Arab Conference on Information Technology (ACIT), pp. 1–6. IEEE (2018)
5. Cheeneebash, J., Nadal, C.: Using tabu search heuristics in solving the vehicle routing problem with time windows: application to a Mauritian firm. Univ. Maurit. Res. J. 16, 448–471 (2010)