Crossmark

Solving 0–1 knapsack problem by binary flower pollination algorithm

Crossref DOI link: https://doi.org/10.1007/s00521-018-3375-7

Published Online: 2018-02-28

Published Print: 2019-09

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Abdel-Basset, Mohamed

El-Shahat, Doaa

El-Henawy, Ibrahim
License Information

Text and Data Mining valid from 2018-02-28
More Information

Article History

Received: 8 February 2017

Accepted: 21 February 2018

First Online: 28 February 2018

Compliance with ethical standards

:

: The authors declare that there is no conflict of interests regarding the publication of this paper.