Skip to main content

1 Result(s)

within Conference Paper Remove this filter Mohamed Abdel-Basset Remove this filter

and

  1. No Access

    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...

    Mohamed Abdel-Basset, Qifang Luo, Fahui Miao… in Intelligent Computing Methodologies (2017)