IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v84y1995i3p599-617.html
   My bibliography  Save this article

An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems

Author

Listed:
  • Arenales, Marcos
  • Morabito, Reinaldo

Abstract

No abstract is available for this item.

Suggested Citation

  • Arenales, Marcos & Morabito, Reinaldo, 1995. "An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 599-617, August.
  • Handle: RePEc:eee:ejores:v:84:y:1995:i:3:p:599-617
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00026-M
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dowsland, Kathryn A., 1987. "An exact algorithm for the pallet loading problem," European Journal of Operational Research, Elsevier, vol. 31(1), pages 78-84, July.
    2. Biro, Milos & Boros, Endre, 1984. "Network flows and non-guillotine cutting patterns," European Journal of Operational Research, Elsevier, vol. 16(2), pages 215-221, May.
    3. Dowsland, Kathryn A., 1990. "Efficient automated pallet loading," European Journal of Operational Research, Elsevier, vol. 44(2), pages 232-238, January.
    4. Dowsland, Kathryn A. & Dowsland, William B., 1992. "Packing problems," European Journal of Operational Research, Elsevier, vol. 56(1), pages 2-14, January.
    5. Dyckhoff, Harald, 1990. "A typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 44(2), pages 145-159, January.
    6. Morabito, R. N. & Arenales, M. N. & Arcaro, V. F., 1992. "An and--or-graph approach for two-dimensional cutting problems," European Journal of Operational Research, Elsevier, vol. 58(2), pages 263-271, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. G, Young-Gun & Kang, Maing-Kyu, 2001. "A fast algorithm for two-dimensional pallet loading problems of large size," European Journal of Operational Research, Elsevier, vol. 134(1), pages 193-202, October.
    2. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    3. Alvarez-Valdes, R. & Parreno, F. & Tamarit, J.M., 2007. "A tabu search algorithm for a two-dimensional non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1167-1182, December.
    4. Hoto, Robinson & Arenales, Marcos & Maculan, Nelson, 2007. "The one dimensional Compartmentalised Knapsack Problem: A case study," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1183-1195, December.
    5. Lins, Lauro & Lins, Sostenes & Morabito, Reinaldo, 2002. "An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container," European Journal of Operational Research, Elsevier, vol. 141(2), pages 421-439, September.
    6. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    7. repec:pal:jorsoc:v:56:y:2005:i:4:d:10.1057_palgrave.jors.2601829 is not listed on IDEAS
    8. repec:pal:jorsoc:v:61:y:2010:i:2:d:10.1057_jors.2008.141 is not listed on IDEAS
    9. Bhattacharya, Subir & Roy, Rahul & Bhattacharya, Sumita, 1998. "An exact depth-first algorithm for the pallet loading problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 610-625, November.
    10. repec:pal:jorsoc:v:54:y:2003:i:7:d:10.1057_palgrave.jors.2601553 is not listed on IDEAS
    11. Martins, Gustavo H.A. & Dell, Robert F., 2008. "Solving the pallet loading problem," European Journal of Operational Research, Elsevier, vol. 184(2), pages 429-440, January.
    12. Cintra, G.F. & Miyazawa, F.K. & Wakabayashi, Y. & Xavier, E.C., 2008. "Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation," European Journal of Operational Research, Elsevier, vol. 191(1), pages 61-85, November.
    13. Morabito, Reinaldo & Arenales, Marcos N., 1996. "Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach," European Journal of Operational Research, Elsevier, vol. 94(3), pages 548-560, November.
    14. Yanasse, Horacio Hideki & Pinto Lamosa, Maria Jose, 2007. "An integrated cutting stock and sequencing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1353-1370, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:84:y:1995:i:3:p:599-617. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.