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

Regular packing of congruent polygons on the rectangular sheet

Author

Listed:
  • Stoyan, Yu. G.
  • Pankratov, A. V.

Abstract

No abstract is available for this item.

Suggested Citation

  • Stoyan, Yu. G. & Pankratov, A. V., 1999. "Regular packing of congruent polygons on the rectangular sheet," European Journal of Operational Research, Elsevier, vol. 113(3), pages 653-675, March.
    • Handle: RePEc:eee:ejores:v:113:y:1999:i:3:p:653-675
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00050-2
    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. & Dowsland, William B., 1992. "Packing problems," European Journal of Operational Research, Elsevier, vol. 56(1), pages 2-14, January.
    2. J. E. Beasley, 1985. "An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure," Operations Research, INFORMS, vol. 33(1), pages 49-64, February.
    3. Stoyan, Yu. G. & Novozhilova, M. V. & Kartashov, A. V., 1996. "Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 193-210, July.
    4. Dyckhoff, Harald, 1990. "A typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 44(2), pages 145-159, January.
    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. J. Bennell & G. Scheithauer & Y. Stoyan & T. Romanova, 2010. "Tools of mathematical modeling of arbitrary object packing problems," Annals of Operations Research, Springer, vol. 179(1), pages 343-368, September.
    2. Costa, M. Teresa & Gomes, A. Miguel & Oliveira, José F., 2009. "Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet," European Journal of Operational Research, Elsevier, vol. 192(1), pages 29-40, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. 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.
    3. Song, X. & Chu, C.B. & Lewis, R. & Nie, Y.Y. & Thompson, J., 2010. "A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting," European Journal of Operational Research, Elsevier, vol. 202(2), pages 368-378, April.
    4. 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.
    5. Lodi, Andrea & Martello, Silvano & Vigo, Daniele, 1999. "Approximation algorithms for the oriented two-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 112(1), pages 158-166, January.
    6. Stoyan, Yu. G. & Novozhilova, M. V. & Kartashov, A. V., 1996. "Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 193-210, July.
    7. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.
    8. Baldacci, Roberto & Boschetti, Marco A., 2007. "A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1136-1149, December.
    9. 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.
    10. Letchford, Adam N. & Amaral, Andre, 2001. "Analysis of upper bounds for the Pallet Loading Problem," European Journal of Operational Research, Elsevier, vol. 132(3), pages 582-593, August.
    11. Faina, Loris, 1999. "An application of simulated annealing to the cutting stock problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 542-556, May.
    12. Morabito, Reinaldo & Belluzzo, Luciano, 2007. "Optimising the cutting of wood fibre plates in the hardboard industry," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1405-1420, December.
    13. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    14. E G Birgin & R D Lobato & R Morabito, 2010. "An effective recursive partitioning approach for the packing of identical rectangles in a rectangle," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(2), pages 306-320, February.
    15. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    16. Hifi, M. & Zissimopoulos, V., 1996. "A recursive exact algorithm for weighted two-dimensional cutting," European Journal of Operational Research, Elsevier, vol. 91(3), pages 553-564, June.
    17. G M Ribeiro & L A N Lorena, 2008. "Optimizing the woodpulp stowage using Lagrangean relaxation with clusters," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 600-606, May.
    18. J A Bennell & J F Oliveira, 2009. "A tutorial in irregular shape packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 93-105, May.
    19. Castillo, Ignacio & Kampas, Frank J. & Pintér, János D., 2008. "Solving circle packing problems by global optimization: Numerical results and industrial applications," European Journal of Operational Research, Elsevier, vol. 191(3), pages 786-802, December.
    20. Ben Messaoud, Said & Chu, Chengbin & Espinouse, Marie-Laure, 2008. "Characterization and modelling of guillotine constraints," European Journal of Operational Research, Elsevier, vol. 191(1), pages 112-126, November.

    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:113:y:1999:i:3:p:653-675. See general information about how to correct material in RePEc.

    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 bibliographic 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.

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

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.