in reply to Help with attempting to solve cutting stock problem (knapsack)

The knapsack problem is a well-known problem from the literature. It's also known to be NP-complete, which means that there is no known efficient solution.

If you really must solve this, and it should be done fast, do a literature study, and implement one of the faster algorithms you'll see. In C.

Abigail

  • Comment on Re: Help with attempting to solve cutting stock problem (knapsack)

Replies are listed 'Best First'.
Re: Re: Help with attempting to solve cutting stock problem (knapsack)
by Cine (Friar) on Jan 16, 2004 at 16:42 UTC
    Given that he knows the name of the problem and the method to solve it fairly effectively (Branch N' Bound) suggest he already knows this and is simply interested in some help with the specific implementation...


    T I M T O W T D I
[reply]
[d/l]

      Either that, or he's having problems completing his homework...

[reply]

In Section Seekers of Perl Wisdom