Checkerboard pattern: Proposals for its generation

International Transactions in Operational Research

Volumn 12, Issue 1, 2005, Pages 21-45

  Yanasse, H H ^a   Katsurayama, D M ^a  

^a INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Checkerboard pattern; Enumerative algorithm; Heuristic; Productivity analysis

Indexed keywords

EID: 33745163772     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2005.00488.x     Document Type: Article

References (22)

1. Arenales, M.N., Morabito, R., (ed), 1997. The cutting and packing problem and industrial applications. XX Brazilian Congress of Applied and Computational Mathematics (XX CNMAC), Gramado. (in Portuguese).
2. Beasley, J.E., 1985. Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society, 36 (4), 297-306.
3. Dowsland, K., Dowsland, W., 1992. Packing problems. European Journal of Operations Research, 56, 2-14. DOI: 10.1016/0377-2217(92)90288-K
4. Dyckhoff, H., 1990. A typology of cutting and packing problems. European Journal of Operations Research, 44, 145-159. DOI: 10.1016/0377-2217(90)90350-K
5. Dyckhoff, H., Finke, U., 1992. Cutting and packing in production and distribution: typology and bibliography. Springer, Heidelberg.
6. Dyckhoff, H., Kuse, H.-J., Abel, D., Gal, T., 1985. Trim loss and related problems. Omega, 13, 59-72. DOI: 10.1016/0305-0483(85)90083-0
7. Gilmore, P., Gomory, R., 1961. A linear programming approach to the cutting-stock problem. Operations Research, 9, 848-859.
8. Gilmore, P., Gomory, R., 1963. A linear programming approach to the cutting-stock problem II. Operations Research, 11, 863-888.
9. Gilmore, P., Gomory, R., 1965. Multistage cutting stock problems of two and more dimensions. Operations Research, 13, 94-120.
10. Hinxman, A., 1980. The trim-loss and assortment problems: a survey. European Journal of Operational Research, 5, 8-18. DOI: 10.1016/0377-2217(80)90068-5
11. Lawler, E.L., 1972. A procedure for computing the k-best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18, (7), 401-405.
12. Linpack Benchmark, 2003. 〈http://www.lac.inpe.br/massaru/download〉
13. Martello, S., Toth, P., 1990b. Knapsack problems - Algorithms and computer implementations. John Wiley & Sons, Chichester.
14. Morabito, R., Arenales, M.N., 2000. Optimizing the cutting of stock plates in a furniture company. International Journal of Production Research, 12 (38), 2725-2742.
15. OR-Library, 2003. 〈http://www.netlib.org/benchmark/linpackjava/〉
16. Scheithauer, G., 2002. On a two dimensional guillotine cutting problem. IFORS XVI. Edinburgh, UK
17. Sweeney, P., Patternoster, E., 1992. Cutting and packing problems: a categorised, application-oriented research bibliography. Journal of the Operational Research Society, 43, 691-706.
18. Wolsey, L.A., 1973. Generalized dynamic programming methods in integer programming. Mathematical Programming, 4, 222-232.
19. Yanasse, H.H., Morabito, R., Linear models for two-stage constrained two-dimensional guillotine cutting problems. Forthcoming
20. Yanasse, H.H., Soma, N.Y., 1987. A new enumeration scheme for the knapsack problem. Discrete Applied Mathematics, 18, 235-245.
21. Yanasse, H.H., Soma, N.Y., 1990. Finding the k-best solutions to a value independent knapsack problem. IFORS XII, Athens, Greece
22. Yanasse, H.H., Soma, N.Y., Maculan, N., 2000. An algorithm for determining the k-best solutions of the one-dimensional knapsack problem. Pesquisa Operacional, 1 (20), 117-134.