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

Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds

Author

Listed:
  • Arslanov, M.Z.
  • Ashigaliev, D.U.
  • Ismail, E.E.

Abstract

No abstract is available for this item.

Suggested Citation

  • Arslanov, M.Z. & Ashigaliev, D.U. & Ismail, E.E., 2008. "Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds," European Journal of Operational Research, Elsevier, vol. 185(1), pages 105-121, February.
    • Handle: RePEc:eee:ejores:v:185:y:2008:i:1:p:105-121
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00067-7
    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. Mhand Hifi & Catherine Roucairol, 2001. "Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems," Journal of Combinatorial Optimization, Springer, vol. 5(4), pages 465-494, December.
    2. Dyckhoff, Harald, 1990. "A typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 44(2), pages 145-159, January.
    3. Eberhard Girlich & Alexander G. Tarnowski, 1999. "On polynomial solvability of two multiprocessor scheduling problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 50(1), pages 27-51, August.
    4. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    5. Arslanov, M. Z., 2000. "Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles," European Journal of Operational Research, Elsevier, vol. 125(2), pages 239-248, September.
    6. Silvano Martello & Daniele Vigo, 1998. "Exact Solution of the Two-Dimensional Finite Bin Packing Problem," Management Science, INFORMS, vol. 44(3), pages 388-399, March.
    Full references (including those not matched with items on IDEAS)

    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. Parreño, F. & Alvarez-Valdes, R., 2021. "Mathematical models for a cutting problem in the glass manufacturing industry," Omega, Elsevier, vol. 103(C).
    2. Mhand Hifi & Rym M'Hallah, 2005. "An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems," Operations Research, INFORMS, vol. 53(1), pages 140-150, February.
    3. Ramón Alvarez-Valdes & Rafael Martí & Jose M. Tamarit & Antonio Parajón, 2007. "GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 261-272, May.
    4. Hifi, Mhand & M'Hallah, Rym, 2006. "Strip generation algorithms for constrained two-dimensional two-staged cutting problems," European Journal of Operational Research, Elsevier, vol. 172(2), pages 515-527, July.
    5. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    6. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    7. Hu, Qian & Wei, Lijun & Lim, Andrew, 2018. "The two-dimensional vector packing problem with general costs," Omega, Elsevier, vol. 74(C), pages 59-69.
    8. Hadj Salem, Khadija & Silva, Elsa & Oliveira, José Fernando & Carravilla, Maria Antónia, 2023. "Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry," European Journal of Operational Research, Elsevier, vol. 306(2), pages 549-566.
    9. Mhand Hifi & Toufik Saadi, 2012. "A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems," Computational Optimization and Applications, Springer, vol. 51(2), pages 783-807, March.
    10. Silva, Elsa & Oliveira, José F. & Wäscher, Gerhard, 2014. "2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 237(3), pages 846-856.
    11. H. Terashima-Marín & P. Ross & C. Farías-Zárate & E. López-Camacho & M. Valenzuela-Rendón, 2010. "Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems," Annals of Operations Research, Springer, vol. 179(1), pages 369-392, September.
    12. Mhand Hifi & Rym M'Hallah & Toufik Saadi, 2008. "Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 212-221, May.
    13. 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.
    14. Parreño, F. & Alonso, M.T. & Alvarez-Valdes, R., 2020. "Solving a large cutting problem in the glass manufacturing industry," European Journal of Operational Research, Elsevier, vol. 287(1), pages 378-388.
    15. Mhand Hifi, 2004. "Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 65-84, March.
    16. Braam, Florian & van den Berg, Daan, 2022. "Which rectangle sets have perfect packings?," Operations Research Perspectives, Elsevier, vol. 9(C).
    17. Zhu, Wenbin & Zhang, Zhaoyi & Oon, Wee-Chong & Lim, Andrew, 2012. "Space defragmentation for packing problems," European Journal of Operational Research, Elsevier, vol. 222(3), pages 452-463.
    18. Önder Aşık & Ender Özcan, 2009. "Bidirectional best-fit heuristic for orthogonal rectangular strip packing," Annals of Operations Research, Springer, vol. 172(1), pages 405-427, November.
    19. 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.
    20. Silvano Martello & David Pisinger & Daniele Vigo, 2000. "The Three-Dimensional Bin Packing Problem," Operations Research, INFORMS, vol. 48(2), pages 256-267, April.

    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:185:y:2008:i:1:p:105-121. 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.