

A090380


Number of iterations used by a 2D cutting stock problem related algorithm.


0




OFFSET

1,2


COMMENTS

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.


LINKS

Table of n, a(n) for n=1..6.


CROSSREFS

Sequence in context: A135214 A218120 A259849 * A142898 A159678 A162803
Adjacent sequences: A090377 A090378 A090379 * A090381 A090382 A090383


KEYWORD

nonn,obsc


AUTHOR

Stuart Reed (stu96art(AT)yahoo.com), Jan 29 2004


EXTENSIONS

Definition reworded by M. F. Hasler, Apr 07 2009


STATUS

approved



