Realization of Knapsack Problem Solving Algorithm and some of Its Applications
Yugoslav journal of operations research, Tome 19 (2009) no. 1, p. 113
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
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.
Classification :
90C27
Keywords: Knapsack problem, algorithmic realization, optimum budget, network optimization.
Keywords: Knapsack problem, algorithmic realization, optimum budget, network optimization.
@article{YJOR_2009_19_1_a7,
author = {Dimiter Ivanchev and Elena Radovanova},
title = {Realization of {Knapsack} {Problem} {Solving} {Algorithm} and some of {Its} {Applications}},
journal = {Yugoslav journal of operations research},
pages = {113 },
year = {2009},
volume = {19},
number = {1},
zbl = {1274.90317},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2009_19_1_a7/}
}
TY - JOUR AU - Dimiter Ivanchev AU - Elena Radovanova TI - Realization of Knapsack Problem Solving Algorithm and some of Its Applications JO - Yugoslav journal of operations research PY - 2009 SP - 113 VL - 19 IS - 1 UR - http://geodesic.mathdoc.fr/item/YJOR_2009_19_1_a7/ LA - en ID - YJOR_2009_19_1_a7 ER -
Dimiter Ivanchev; Elena Radovanova. Realization of Knapsack Problem Solving Algorithm and some of Its Applications. Yugoslav journal of operations research, Tome 19 (2009) no. 1, p. 113 . http://geodesic.mathdoc.fr/item/YJOR_2009_19_1_a7/