Realization of knapsack problem solving algorithm and some of its applications

Authors

  • Dimiter Ivanchev New Bulgarian University, Sofia, Bulgaria
  • Elena Radovanova Technical University of Sofia, Bulgaria

DOI:

https://doi.org/10.2298/YJOR0901113I

Keywords:

Knapsack problem, algorithmic realization, optimum budget, network optimization

Abstract

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

Ivanchev, D., Mathematical Methods for Network Optimization, NBU, Sofia, 2007.

Gessner, P., and Wacker, H., Dynamische Optimierung, Carl Hansen-Verlag, München, 1972.

Terno, J., „Numerische Verfahren der diskreten Optimierung (Modelle-Algorithmen Komplexität)“, Teubnet-texte zur Mathematik, Band 36 (1981) 168.

Korte, B., J., and Vygen, Combinatorial Optimization (Theory and Algorithms), Springer, Berlin, Heidelberg, New York, 2000.

Downloads

Published

2009-03-01

Issue

Vol. 19 No. 1 (2009)

Section

Research Articles

License

Copyright (c) 2009 YUJOR

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.