Realization of knapsack problem solving algorithm and some of its applications
DOI:
https://doi.org/10.2298/YJOR0901113IKeywords:
Knapsack problem, algorithmic realization, optimum budget, network optimizationAbstract
A realization of one algorithm for solving the classical knapsack problem which is much faster than the dynamical programming method and requires less memory is suggested. The popular situation in the Big Brother TV show is used to exemplify its applicability. For the purpose, the number of the wishes of all players are maximized.References
Gessner, P., Wacker, H. (1972) Dynamische optimierung. München: Carl Hansen-Verlag
Ivanchev, D. (2007) Mathematical methods for network optimization. Sofia: NBU
Korte, B., Vygen, J. (2000) Combinatorial optimization: Theory and algorithms. Berlin: Springer
Terno, J. (1981) Numerische Verfahren der diskreten Optimierung (Modelle-Algorithmen-Komplexität). Teubnet-texte zur Mathematik, Band 36 168
Downloads
Published
2009-03-01
Issue
Section
Research Articles
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.