This site is supported by donations to The OEIS Foundation.



Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090380 Number of iterations used by a 2D cutting stock problem related algorithm. 0
1, 17, 265, 4737, 99721, 2934889 (list; graph; refs; listen; history; text; internal format)



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.


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


Sequence in context: A001282 A135214 A218120 * A142898 A159678 A162803

Adjacent sequences:  A090377 A090378 A090379 * A090381 A090382 A090383




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


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



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified December 21 01:10 EST 2014. Contains 252291 sequences.