Near-optimal solution to a two-dimensional cutting stock problem

Mathematics of Operations Research

Volumn 25, Issue 4, 2000, Pages 645-656

  Kenyon, Claire ^a   Rémila, Eric ^b,c  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ JEAN MONNET   (France)

^c UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PACKAGING; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

CUTTING STOCK PROBLEM; FULLY POLYNOMIAL APPROXIMATION; NEAR OPTIMAL SOLUTION; STRIP PACKING;

LINEAR PROGRAMMING;

EID: 17744406653     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.25.4.645.12118     Document Type: Article

References (19)

1. Amoura, A. K., E. Bampis, C. Kenyon, Y. Manoussakis. 1997. Scheduling multiprocessor tasks on dedicated processors. Proc. 5th Ann. Eur. Sympos. (ESA'97), LNCS 1284, Graz, Austria. 1-12.
2. Baker, B. S., D. J. Brown, H. P. Katseff. 1981. A 5/4 algorithm for two-dimensional packing. J. Algorithms 2 348-368.
3. _, E. G. Coffman, R. L. Rivest. 1980. Orthogonal packings in two dimensions. SIAM J. Comput. 9 846-855.
4. Coffman, E. G. Jr., M. R. Garey, D. S. Johnson. 1984. Approximation algorithms for bin-packing - An updated survey. G. Ausiello, M. Lucertini, P. Serafini, eds. Algorithm Design for Computer System Design, Springer Verlag, Berlin, Germany. 49-106.
5. _, _, _, R. E. Tarjan. 1980. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. 9 808-826.
6. El Moumni, S. 1997. Rangements optimaux de carrés unite dans une bande infinie. Ann. Fac. Sci. Toulose Math. 6(1) 121-125.
7. Erdös, P., R. L. Graham. 1975. On packing squares with equal squares. J. Combin. Theory A 19 119-123.
8. Fernandez de la Vega, W., G. S. Lueker. 1981. Bin packing can be solved within 1 + ε in linear time. Combinatorica 1 349-355.
9. _, V. Zissimopoulos. 1991. An approximation scheme for strip-packing of rectangles with bounded dimensions. LRI, Université Paris Sud, 91405 ORSAY, France.
10. Gilmore, P. C., R. E. Gomory. 1965. Multistage cutting stock problems of two and more dimensions. Oper. Res. 13 94-120.
11. Golan, I. 1981. Performance bounds for orthogonal, oriented two-dimensional packing algorithms. SIAM J. Comput. 10 571-582.
12. Jansen, K., L. Porkolab. 1999. Linear time approximation schemes for scheduling problems. 10th Ann. ACM-SIAM Sympos. Discrete Algorithms, SODA 99, Baltimore, MD, 490-498.
13. Karmarkar, N., R. M. Karp. 1982. An efficient approximation scheme for the one-dimensional bin-packing problem. Proc. 23rd Sympos. Foundations Comput. Sci. (FOCS), Tucson, AZ, 312-320.
14. Kenyon, C., E. Remila. 1996. Approximate strip packing. Proc. 37th Sympos. Foundations Comput. Sci. (FOCS), Burlington, VT. 30-37.
15. Plotkin, S. A., D. B. Shmoys, E. Tardos. 1995. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20(2) 257-403.
16. Schiermeyer, I. 1994. Reverse fit: A 2-optimal algorithm for packing rectangles. Proc. 2nd Eur. Sympos. Algorithms (ESA), Utrecht, The Netherlands, 290-299.
17. Sleator, D. D. 1980. A 2.5 times optimal algorithm for bin packing in two dimensions. Informat. Processing Lett. 10 37-40.
18. Steinberg, A. 1997. A strip-packing algorithm with absolute performance bound 2. SIAM. J. Comput. 26(2) 401-409.
19. Young, N. E. 1995. Randomized Rounding Without Solving the Linear Program. Proc. Sympos. Discrete Algorithms (SODA). 170-178.