An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock

Computers and Operations Research

Volumn 24, Issue 8, 1997, Pages 727-736

  Hifi, Mhand ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

TREE SEARCH PROCEDURES; TWO DIMENSIONAL CUTTING STOCK;

OPERATIONS RESEARCH;

EID: 0031210357     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(96)00095-0     Document Type: Article

References (21)

1. Viswanathan, K. V. and Bagchi, A., Best-first search methods for constrained two-dimensional cutting stock problems. Operations Research, 1993, 41, 4 768-776.
2. Beasley, J. E., Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society, 1985, 36, 297-306.
3. Dowsland, K. and Dowsland, W., Packing problems. European Journal of Operational Research, 1992, 56, 2-14.
4. Gilmore, P. and Gomory, R., Multistage cutting problems of two and more dimensions. Operations Research, 1965, 13, 94-119.
5. Kantorovich, L. V., Mathematical methods of organizing and planning production. Management Science, 1960, 6, 363-422.
6. Syslo, M., Deo, N. and Kowalik, J., Discrete Optimization Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1983.
7. Sweeney, P. and Paternoster, E., Cutting and packing problems: a categorized application-oriented research bibliography. Journal of the Operational Research Society, 1992, 43, 7 691-706.
8. Gilmore, P. and Gomory, R., The theory and computation of knapsack functions. Operations Research, 1966, 14, 1045-1074.
9. Herz, J. C., A recursive computing procedure for two-dimensional stock cutting. IBM Journal of Research and Development, 1972, 16, 462-469.
10. Christofides, N. and Whitlock, C., An algorithm for two-dimensional cutting problems. Operations Research, 1977, 25, 31-44.
11. Wang, P. Y., Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 1983, 31, 3 573-586.
12. 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.
13. Fayard, D. and Zissimopoulos, V., An approximation algorithm for solving unconstrained two-dimensional knapsack problems. European Journal of Operational Research, 1995, 84, 618-632.
14. Fayard, D., Hifi, M. and Zissimopoulos, V., A general algorithm for two-dimensional cutting. Preprint, Ecomath, Université Paris, Paris, 1995.
15. Zissimopoulos, V., Heuristic methods for solving (un)constrained two-dimensional cutting stock problems. Methods of Operations Research, 1984, 49, 345-357.
16. Morabito, R., Arenales, M. and Arcaro, V., An and/or-graph approach for two-dimensional cutting problems. European Journal of Operational Research, 1992, 58, 2 263-271.
17. Hifi, M., Study of some combinatorial optimization problems: cutting stock, rectangular packing and set covering problems. Ph.D. thesis, University of Paris 1, Panthéon-Sorbonne, 1994.
18. Hifi, M., The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems. European Journal of Operational Research, 1997, 0, 0. (to appear)
19. Desler, J. F. and Hakimi, S. L., A graph theoretic approach to a class of integer programming problems. Operations Research, 1969, 17, 1017-1033.
20. Toth, P., Dynamic programming algorithms for zero-one knapsack problem. Computing, 1980, 25, 29-45.
21. Sakarovich, M., Optimisation Combinatoire, Programmation Discrète. Hermann Editeurs des Sciences et des Arts, 1984.