1. Forum
  2. Usenet
  3. SCI.OP-RESEARCH

  • Extracting the solution for a Knapsack problem when solving by dynamic

    From [email protected]@21:1/5 to All on Tue Mar 29 16:18:09 2016
    How to efficiently extract the solution for a Knapsack problem when solving by dynamic programming with lists? In other words is it possible to do this efficiently without storing pointers to the previous states?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From [email protected]@21:1/5 to All on Tue Mar 29 16:31:11 2016
    How to efficiently extract the solution for a 0-1 Knapsack problem when solving by dynamic programming with lists? In other words is it possible to do this efficiently without storing pointers to the previous states?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)