Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Yanhong Feng, Gai-Ge Wang. Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem. IEEE Access, 6:10708-10719, 2018. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: A binary moth search algorithm based on self-learning for multidimensional knapsack problemsYanhong Feng, Gai-Ge Wang. fgcs, 126:48-64, 2022. [doi] Exact and approximate algorithms for discounted {0-1} knapsack problemYi-Chao He, Xi-Zhao Wang, Yu-Lin He, Shu-Liang Zhao, Wen-Bin Li. isci, 369:634-647, 2016. [doi]
The following publications are possibly variants of this publication: