Can I read Improved BCOA for 0-1 Knapsack Problem on EtoBox?

Improved BCOA for 0-1 Knapsack Problem by HOD CSE is a document available to read on EtoBox.

What is Improved BCOA for 0-1 Knapsack Problem about?

This paper presents an improved Binary Coyote Optimization Algorithm (BCOA) for solving the 0-1 knapsack problem, which is a well-known NP-hard combinatorial optimization problem. The authors propose a new time-varying transfer function to enhance the algorithm

Author

HOD CSE

Language

EN