Solving the 0/1 Knapsack Problem by a Biomolecular DNA Computer

Procedure 2

For 𝑖=1 to 𝑛

{

   Separate (𝑇₀,𝑖)→(𝑇⁺,𝑇⁻)

   For 𝑗=1 to 𝑊_𝑖

     Set (𝑇⁺,  𝑛+∑^𝑖−1_𝑘=1𝑊_𝑘+𝑗)

   For 𝑗=1 to 𝑉_𝑖

     Set (𝑇⁺, 𝑛+∑^𝑛_𝑘=1𝑊_𝑘+∑^𝑖−1_𝑘=1𝑉_𝑘+𝑗)

   Combine (𝑇₀,𝑇⁺,𝑇⁻)

}