|
%I #4 Jul 14 2012 11:32:16
%S 1,17,265,4737,99721,2934889
%N Number of iterations used by a 2D cutting stock problem related algorithm.
%C I have a list of rectangles 1, 2, 3, 4, 5, 6 (for the above examples). I am using a recursion program to perform a branch and bound method of the knapsack problem (actually the 2D cutting stock problem). The sequence is the number of iterations of the subprogram that my program produced. The rectangle is placed and then two options are produced. Each option has two different rectangles in which the next target rectangle can be put in. Thus there are 4 calls to the subprogram for each rectangle, yet each rectangle can also be turned sideways.
%K nonn,obsc
%O 1,2
%A Stuart Reed (stu96art(AT)yahoo.com), Jan 29 2004
%E Definition reworded by _M. F. Hasler_, Apr 07 2009
|
