An improved binary search algorithm for the Multiple-Choice Knapsack Problem
RAIRO-Oper. Res., 50 4-5 (2016) 995-1001
Published online: 2016-11-03
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Constrained optimal grouping of cloud application components
Marta Różańska and Geir HornJournal of Cloud Computing 13 (1) (2024)
https://doi.org/10.1186/s13677-024-00653-5
Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications
Xuanfeng Li, Shengcai Liu, Jin Wang, Xiao Chen, Yew-Soon Ong and Ke TangIEEE Transactions on Cybernetics 54 (12) 7969 (2024)
https://doi.org/10.1109/TCYB.2024.3402395
A Cooperative Transmission Scheme in Radio Frequency Energy-Harvesting WBANs
Juncheng Hu, Gaochao Xu, Liang Hu and Shujing LiSustainability 15 (10) 8367 (2023)
https://doi.org/10.3390/su15108367
An efficient population-based simulated annealing algorithm for 0–1 knapsack problem
Nima Moradi, Vahid Kayvanfar and Majid RafieeEngineering with Computers 38 (3) 2771 (2022)
https://doi.org/10.1007/s00366-020-01240-3
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems
Valentina Cacchiani, Manuel Iori, Alberto Locatelli and Silvano MartelloComputers & Operations Research 143 105692 (2022)
https://doi.org/10.1016/j.cor.2021.105692
Multi-level feature driven storage management of surveillance videos
Min-Han Tsai, Nalini Venkatasubramanian and Cheng-Hsin HsuPervasive and Mobile Computing 76 101441 (2021)
https://doi.org/10.1016/j.pmcj.2021.101441