From: “Bernardo B. Terrado” <bbt@mudspring.uplb.edu.ph>
To: coderpunks@toad.com
Message Hash: 8c9e97c71f47ea4b5331cfe1400a82c57b8ea01cc1652be932cac12699c13c15
Message ID: <Pine.GSO.3.96.981116124934.27971A-100000@mudspring.uplb.edu.ph>
Reply To: N/A
UTC Datetime: 1998-11-16 05:42:39 UTC
Raw Date: Mon, 16 Nov 1998 13:42:39 +0800
From: "Bernardo B. Terrado" <bbt@mudspring.uplb.edu.ph>
Date: Mon, 16 Nov 1998 13:42:39 +0800
To: coderpunks@toad.com
Subject: 0/1 knapsack
Message-ID: <Pine.GSO.3.96.981116124934.27971A-100000@mudspring.uplb.edu.ph>
MIME-Version: 1.0
Content-Type: text/plain
Hey guys,
I found this in a web site.
|---v
A knapsack that holds a total....and N indivisible objects....
My quetion is does indivisible means that the object cannot be divided as
dividing a grain of rice? Does this imply I can divide an array of
integers but not the integers?
--------------------------------------------
If I'm going to use 0/1 knapsack algo then I'll just place a tag on each
element let us say 1 for true and 0 for false? which ever element satisfy
the condition?
What is dynamic programming approach (wavefront calculation)? Is it with
the use of pointers? or
different concept?
Thanks.
Bernie
Return to November 1998
Return to “staym@accessdata.com”