Exact algorithms for the guillotine strip cutting/packing problem

Computers and Operations Research

Volumn 25, Issue 11, 1998, Pages 925-940

  Hifi, Mhand ^a  

^a UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

Branch and bound; Combinatorial optimization; Cutting and packing; Dynamic programming; Heuristics

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; PROBLEM SOLVING;

BEST-FIRST SEARCH STRATEGY; BRANCH-AND-BOUND METHOD; GUILLOTINE STRIP CUTTING/PACKING PROBLEM; TWO-DIMENSIONAL CONSTRAINED CUTTING STOCK PROBLEMS;

DYNAMIC PROGRAMMING;

EID: 0032210331     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00008-2     Document Type: Article

References (36)

1. Hifi, M., An improvement of Viswanathan and Bagchi's exact algorithm for cutting stock problems. Computers and Operations Research, 1997, 24(8), 727-736.
2. Viswanathan, K. V. and Bagchi, A., Best-first search methods for constrained two-dimensional cutting stock problems. Operations Research, 1993, 41(4), 768-776.
3. Dyckhoff, H., A typology of cutting and packing problems. European Journal of Operational Research, 1990, 44, 145-159.
4. Sweeney, P. E. and Paternoster, E. R., Cutting and packing problems: a categorized applications-oriented research bibliography. Journal of the Operational Research Society, 1992, 43, 691-706.
5. Baker, B. S., Coffman, E. G. and Rives, R. L., Orthogonal packing in two dimensions. SIAM Journal on Computing, 1980, 9(4), 846-855.
6. Baker, B. S., Brown, D. J. and Katseff, H. P., A 5/4 algorithm for two-dimensional packing. Journal of Algorithms, 1981, 2(4), 348-368.
7. Coffman, E. G., Garey, M. R., Johnson, D. S. and Tarjan, R. E., Performance bounds for level oriented two-dimensional packing problem. SIAM Journal on Computing, 1980, 9, 808-826.
8. Bartholdi, J. J., Vande Vate, J. H. and Zhang, J., Expected performance of the shelf heuristic for two-dimensional packing. Operations Research Letters, 1989, 8, 11-16.
9. Coffman, E. G. and Lagarias, J. C., Algorithms for packing squares: a probabilistic analysis. SIAM Journal on Computing, 1989, 18(1), 166-185.
10. Coffman, E. G. and Shor, P. W., Average-case analysis of cutting and packing in two dimensions. European Journal of Operational Research, 1990, 44, 134-144.
11. Fernandez de la Vega, W. and Lueker, G. S., Bin packing can be solved within 1 + ∈ in linear time. Combinatoria, 1981, 1(4), 349-355.
12. Hinxman, A. I., The trim-loss and assortment problems: a survey. European Journal of Operational Research, 1980, 5, 8-18.
13. Hofri, M., Two-dimensional packing: Expected performance of simple level algorithms. Information and Control, 1980, 45, 1-17.
14. Jakobs, S., On genetic algorithms for the packing of polygons. European Journal of Operational Research, 1996, 88, 165-181.
15. Duijvestijn, A. J., Simple perfect squared square of lowest order. Journal of Combinatorial Theory, 1978, 25(B), 260-263.
16. Federico, P. J., Bondy, J. A. and Murty, U. S. R., Squaring rectangles and squares. In Graph Theory and Related Topics. Editions Academic Press, 1979.
17. Hifi, M. and Ouafi R., A best-first branch-and-bound algorithm for orthogonal rectangular packing problems. International Transactions in Operational Research (to appear).
18. Kleitman, D. J. and Krieger, M. K., An optimal bound for two dimensional bin packing. In Proceedings of the 16th Annual Symposium on Foundations of Computer Science. 1975, pp. 163-168.
19. Beasley, J. E., Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society, 1985, 36, 297-306.
20. Christofides, N. and Whitlock, C., An algorithm for two-dimensional cutting problems. Operations Research, 1977, 2, 31-44.
21. Gilmore, P. C. and Gomory, R. E., The theory and computation of knapsack functions. Operations Research, 1965, 14, 1045-1074.
22. Lawler, E. L., Fast approximation algorithms for knapsack problems. Mathematics of Operations Research, 1979, 4(2), 339-356.
23. Toth, P., Dynamic programming algorithms for zero-one knapsack problem. Computing, 1980, 25, 29-45.
24. Wang, P. Y., Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 1983, 31(3), 573-586.
25. Albano, A., A method to improve two-dimensional layout. Comp. Aid. Des., 1977, 9, 48-52.
26. Albano, A. and Sapuppo, G., Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Trans. Sys. Man. Cyb., 1980, 10(5), 242-248.
27. Oliveira, J. F. and Ferreira, J. S., An improved version of Wang's algorithm for two-dimensional cutting problems. European Journal of Operational Research, 1990, 44, 256-266.
28. Vasko, F. J., A computational improvement to Wang's two-dimensional cutting stock algorithm. Computers and Industrial Engineering, 1989, 16, 109-115.
29. Zissimopoulos, V., Heuristic methods for solving (un)constrained two-dimensional cutting stock problems. Methods of Operations Research, 1984, 49, 345-357.
30. Hifi, M. and Zissimopoulos, V., A recursive exact algorithm for weighted two-dimensional cutting. European Journal of Operational Research, 1996, 91, 553-564.
31. Fayard, D., Hifi, M. and Zissimopoulos, V., A general efficient approach for large-scale two-dimensional cutting stock problems. Working Paper Eco and Maths. CERMSEM, Université de Paris 1, 90 rue de Tolbiac, 75013 Paris, France, 1996.
32. Ibarra, O. H. and Kim, C. E., Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM, 1975, 22(4), 463-468.
33. Garey, M. R. and Johnson, D. S., Computers and Intractability. A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
34. Andonov, R., Raimbault, F. and Quinton, P., Dynamic programming: parallel implementation for the knapsack problem. Preprint IRISA, No. 740. Campus de Beaulieu, 35042 Rennes Cedex, 1993.
35. Chen, G., Chern, M. and Jang, J., Pipeline architectures for dynamic programming algorithms. Parallel Computing, 1990, 13, 111-117.
36. Cung, V.-D., Hifi, M. and Le Cun, B., Constrained two-dimensional cutting stock problems and the BOB Library: A parallel algorithm. 16th International Symposium on Mathematical Programming ISMP97. Ecole Polytechnique Federale de Lausanne, Switzerland, August 24-29, 1997.