Author:
Mohammed Zaidy Y.,Al-Neama Mohammed W.
Reference14 articles.
1. Martello, S. and Toth, P. (1990) ‘Knapsack problems: Algorithms and computer implementations’, 605 Third Avenue, New York, NY 10158-0012, USA: John Wiley & Sons.
2. Chajakis, E.D. and Guignard, M. (1994) ‘Exact algorithms for the setup knapsack problem’, INFOR, Vol. 32, pp.124–142.
3. Cho, M. (2019). The Knapsack Problem and Its Applications to the Cargo Loading Problem. Analysis of Applied Mathematics, 48.
4. Laha, M., Kamble, S., & Datta, R. (2020, February). Edge Nodes Placement in 5G enabled Urban Vehicular Networks: A Centrality-based Approach. In 2020 National Conference on Communications (NCC) (pp. 1–6). IEEE.
5. Randomized time‐varying knapsack problems via binary beetle antennae search algorithm: Emphasis on applications in portfolio insurance