Page
%P
-
Chapter and Conference Paper
Solving 0–1 Knapsack Problems by Binary Dragonfly Algorithm
The 0–1 knapsack problem (0–1KP) is a well-known combinatorial optimization problem. It is an NP-hard problem which plays significant roles in many real life applications. Dragonfly algorithm (DA) a novel swar...