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

A note on the approximability of cutting stock problems

Author

Listed:
  • Cintra, G.F.
  • Miyazawa, F.K.
  • Wakabayashi, Y.
  • Xavier, E.C.

Abstract

No abstract is available for this item.

Suggested Citation

  • Cintra, G.F. & Miyazawa, F.K. & Wakabayashi, Y. & Xavier, E.C., 2007. "A note on the approximability of cutting stock problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1328-1332, December.
    • Handle: RePEc:eee:ejores:v:183:y:2007:i:3:p:1328-1332
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00307-9
    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. Cheng, C. H. & Feiring, B. R. & Cheng, T. C. E., 1994. "The cutting stock problem -- a survey," International Journal of Production Economics, Elsevier, vol. 36(3), pages 291-305, October.
    2. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    3. Scheithauer, Guntram & Terno, Johannes, 1995. "The modified integer round-up property of the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 84(3), pages 562-571, August.
    4. P. C. Gilmore & R. E. Gomory, 1963. "A Linear Programming Approach to the Cutting Stock Problem---Part II," Operations Research, INFORMS, vol. 11(6), pages 863-888, December.
    5. Frenk, J.B.G. & Galambos, G., 1987. "Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem," Econometric Institute Research Papers 11691, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. P. C. Gilmore & R. E. Gomory, 1965. "Multistage Cutting Stock Problems of Two and More Dimensions," Operations Research, INFORMS, vol. 13(1), pages 94-120, February.
    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. 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.

    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. 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.
    2. Belov, G. & Scheithauer, G., 2006. "A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting," European Journal of Operational Research, Elsevier, vol. 171(1), pages 85-106, May.
    3. Morgan, Leslie O. & Morton, Alysse R. & Daniels, Richard L., 2006. "Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets," European Journal of Operational Research, Elsevier, vol. 172(3), pages 747-760, August.
    4. Chengbin Chu & Julien Antonio, 1999. "Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems," Operations Research, INFORMS, vol. 47(4), pages 495-508, August.
    5. Ortmann, Frank G. & Ntene, Nthabiseng & van Vuuren, Jan H., 2010. "New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 306-315, June.
    6. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    7. W. D. D. Madhavee & N. Saldin & U. C. Vaidyarathna & C. J. Jayawardene, 2018. "A Practical Application of the Generalized Cutting Stock Algorithm," Academic Journal of Applied Mathematical Sciences, Academic Research Publishing Group, vol. 4(3), pages 15-21, 03-2018.
    8. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    9. Gomory, Ralph, 2016. "Origin and early evolution of corner polyhedra," European Journal of Operational Research, Elsevier, vol. 253(3), pages 543-556.
    10. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.
    11. 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.
    12. Wuttke, David A. & Heese, H. Sebastian, 2018. "Two-dimensional cutting stock problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 265(1), pages 303-315.
    13. Furini, Fabio & Malaguti, Enrico & Medina Durán, Rosa & Persiani, Alfredo & Toth, Paolo, 2012. "A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size," European Journal of Operational Research, Elsevier, vol. 218(1), pages 251-260.
    14. Oliveira, Washington A. & Fiorotto, Diego J. & Song, Xiang & Jones, Dylan F., 2021. "An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 996-1007.
    15. Yuen, Boon J., 1995. "Improved heuristics for sequencing cutting patterns," European Journal of Operational Research, Elsevier, vol. 87(1), pages 57-64, November.
    16. de Gelder, E.R. & Wagelmans, A.P.M., 2007. "The two-dimensional cutting stock problem within the roller blind production process," Econometric Institute Research Papers EI 2007-47, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    17. Kelly Poldi & Silvio Araujo, 2016. "Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem," Annals of Operations Research, Springer, vol. 238(1), pages 497-520, March.
    18. 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.
    19. Douglas Nogueira Nascimento & Adriana Cristina Cherri & José Fernando Oliveira, 2022. "The two-dimensional cutting stock problem with usable leftovers: mathematical modelling and heuristic approaches," Operational Research, Springer, vol. 22(5), pages 5363-5403, November.
    20. Puchinger, Jakob & Raidl, Gunther R., 2007. "Models and algorithms for three-stage two-dimensional bin packing," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1304-1327, 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:183:y:2007:i:3:p:1328-1332. 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.