A quarta-feira, 14 de maio de 2008 à(s) 22:29:43 UTC+1, Mark Lawton escreveu:

There is a worked example of how to solve a basic Cutting Stock
Problem at http://docs.google.com/View?docid=dfkkh8qj_64rrpz86db . It
uses simple methods, and the open source program lp_solve. Briefly,
the solution shown is:
* create a list of cut combinations (not permutations - there would be
too many of those to work with in most cases)
* from this list, generate a set of linear programming (simplex)
expressions, and output them to a file
* this file becomes the input to lp_solve, which calculates an optimal solution
* most of the cut combinations in the solution will have a score of
zero. For those that have a score greater than zero, look them up on
the list created in step 1

Podes dar-me invite?

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