We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback