Open Access
SHS Web Conf.
Volume 144, 2022
2022 International Conference on Science and Technology Ethics and Human Future (STEHF 2022)
Article Number 03009
Number of page(s) 5
Section Application of Artificial Intelligence Technology and Machine Learning Algorithms
Published online 26 August 2022
  1. Chu, P., & Beasley, J. (1998). A Genetic Algorithm for the Multidimensional Knapsack Problem. Journal of Heuristics, 4(1), 63–86. [CrossRef] [Google Scholar]
  2. Martello, S., & Toth, P. (1987). Algorithms for Knapsack Problems. North-Holland Mathematics Studies, 132, 213–257. [CrossRef] [Google Scholar]
  3. Vince, A. (2001). A framework for the greedy algorithm. DISCRETE APPLIED MATHMATICS. [Google Scholar]
  4. Wolsey, L. A. (1982). An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, 2(4), 385–393. [CrossRef] [Google Scholar]
  5. Eddy, S. R. (2004). What is dynamic programming? Nature Biotechnology, 22(7), 909–910. [CrossRef] [Google Scholar]
  6. Rahwan, T., & r Jennings, N. (2008). An Improved Dynamic Programming Algorithm for Coalition Structure Generation. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.