A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classicalNP-hard cutting-stock problem. The algorithm, based on a new linear-programming relaxation, finds a packing ofn rectangles whose total height is within a factor of (1 +e) of optimal (up to an additive term), and has running time polynomial both in n and in 1/ e.

[1]  Paul Erdös,et al.  On Packing Squares with Equal Squares , 1975, J. Comb. Theory, Ser. A.

[2]  A. Steinberg,et al.  A Strip-Packing Algorithm with Absolute Performance Bound 2 , 1997, SIAM J. Comput..

[3]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[5]  Daniel Dominic Sleator,et al.  A 2.5 Times Optimal Algorithm for Packing in Two Dimensions , 1980, Inf. Process. Lett..

[6]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[7]  Ingo Schiermeyer,et al.  Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles , 1994, ESA.

[8]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

[9]  Brenda S. Baker,et al.  A 5/4 Algorithm for Two-Dimensional Packing , 1981, J. Algorithms.

[10]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[11]  Saïd El Moumni.  Rangements optimaux de carrés unité dans une bande infinie , 1997 .

[12]  Wenceslas Fernandez de la Vega,et al.  An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions , 1998, Discret. Appl. Math..

[13]  Igal Golan,et al.  Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms , 1981, SIAM J. Comput..

[14]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[15]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[16]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[17]  Chuan Yi Tang,et al.  A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem , 1993, Inf. Process. Lett..

[18]  Claire Mathieu,et al.  Approximate strip packing , 1996, Proceedings of 37th Conference on Foundations of Computer Science.