| Article ID: | iaor200970207 |
| Country: | Serbia |
| Volume: | 19 |
| Issue: | 1 |
| Start Page Number: | 113 |
| End Page Number: | 122 |
| Publication Date: | Jan 2009 |
| Journal: | Yugoslav Journal of Operations Research |
| Authors: | Ivanchev Dimiter, Radovanova Elena |
| Keywords: | communications |
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.