Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

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

by Abigail-II (Bishop)
on Jan 16, 2004 at 16:29 UTC ( [id://321818]=note: print w/replies, xml ) Need Help??


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

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

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

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://321818]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others romping around the Monastery: (6)
As of 2024-03-29 01:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found