An improved discreet Jaya optimisation algorithm with mutation operator and opposition-based learning to solve the 0-1 knapsack problem. - Mohammad Subhi Al-Batah; Mohammed Riyad Al-Eiadeh (Int. J. Math. Oper. Res., 2023)