Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

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

by markov (Scribe)
on Jan 16, 2004 at 16:51 UTC ( #321827=note: print w/ replies, xml ) Need Help??


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

Although Abigail is correct (NP complete problems like this one have no efficient solutions for large sets of data), you still can create software which runs it fast.

At least there are two ways to improve it:

  1. implement and algorithm which is smarter than branch-and-bound. A lot of work, requires sufficient education in programming techniques.
  2. exchange required computation force with memory consumption. Use Memoize (by MJ Dominous) on KNAP and you'll see the the speed become linear and memory consumption grow exponentially... In some cases, you may be able to buy a sufficient amount of memory to replace unrealistic time to wait. (for instance, for stock calculations, minutes may already be too long to wait)


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

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (17)
As of 2014-07-11 15:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    When choosing user names for websites, I prefer to use:








    Results (230 votes), past polls