bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix 'weight' -> 'value' in Knapsack solution 2

This commit is contained in:
JulienC 2017-04-23 18:48:15 -04:00
parent c775c02881
commit 491faeebbd
No known key found for this signature in database
GPG Key ID: B5FBCE78A6BB7A13
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
chapter07.tex
View File

@ -683,7 +683,7 @@ using the following sequence:
denote the smallest possible total weight denote the smallest possible total weight
when a subset of objects when a subset of objects
$1 \ldots k$ is selected such $1 \ldots k$ is selected such
that the total weight is $u$. that the total value is $u$.
The solution to the problem is the The solution to the problem is the
largest value $u$ largest value $u$
for which $0 \le u \le s$ and $f(n,u) \le x$ for which $0 \le u \le s$ and $f(n,u) \le x$