IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v141y2002i2p274-294.html
   My bibliography  Save this item

A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths

Citations

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


Cited by:

  1. C. Arbib & F. Marinelli, 2009. "Exact and Asymptotically Exact Solutions for a Class of Assortment Problems," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 13-25, February.
  2. Mauro Baldi & Teodor Crainic & Guido Perboli & Roberto Tadei, 2014. "Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items," Annals of Operations Research, Springer, vol. 222(1), pages 125-141, November.
  3. Erjavec, J. & Gradisar, M. & Trkman, P., 2012. "Assessment of stock size to minimize cutting stock production costs," International Journal of Production Economics, Elsevier, vol. 135(1), pages 170-176.
  4. 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.
  5. Istvan Borgulya, 2024. "A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin 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. 32(1), pages 45-65, March.
  6. Krzysztof C. Kiwiel, 2010. "An Inexact Bundle Approach to Cutting-Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 131-143, February.
  7. Alves, Claudio & Valerio de Carvalho, J.M., 2007. "Accelerating column generation for variable sized bin-packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1333-1352, December.
  8. 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.
  9. Yaodong Cui & Xiang Song & Yan Chen & Yi-Ping Cui, 2017. "New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(3), pages 269-280, March.
  10. Elisama Araújo Silva Oliveira & Elizabeth Wanner & Elisangela Martins Sá & Sérgio Ricardo Souza, 2025. "A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs," Journal of Heuristics, Springer, vol. 31(1), pages 1-57, March.
  11. Qi Zhang & Shixin Liu & Ruiyou Zhang & Shujin Qin, 2021. "Column generation algorithms for mother plate design in steel plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 127-153, March.
  12. Olivier Lalonde & Jean-François Côté & Bernard Gendron, 2022. "A Branch-and-Price Algorithm for the Multiple Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3134-3150, November.
  13. Mohamed Maiza & Abdenour Labed & Mohammed Radjef, 2013. "Efficient algorithms for the offline variable sized bin-packing problem," Journal of Global Optimization, Springer, vol. 57(3), pages 1025-1038, November.
  14. Andrea Bettinelli & Alberto Ceselli & Giovanni Righini, 2010. "A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint," Annals of Operations Research, Springer, vol. 179(1), pages 221-241, September.
  15. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
  16. Gleb Belov & Guntram Scheithauer, 2007. "Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 27-35, February.
  17. Trkman, Peter & Gradisar, Miro, 2007. "One-dimensional cutting stock optimization in consecutive time periods," European Journal of Operational Research, Elsevier, vol. 179(2), pages 291-301, June.
  18. Arbib, Claudio & Marinelli, Fabrizio, 2007. "An optimization model for trim loss minimization in an automotive glass plant," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1421-1432, December.
  19. S. Michel & F. Vanderbeck, 2012. "A Column-Generation Based Tactical Planning Method for Inventory Routing," Operations Research, INFORMS, vol. 60(2), pages 382-397, April.
  20. Hawa, Asyl L. & Lewis, Rhyd & Thompson, Jonathan M., 2022. "Exact and approximate methods for the score-constrained packing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 847-859.
  21. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
  22. Adejuyigbe O. Fajemisin & Steven D. Prestwich & Laura Climent, 2023. "Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 139-164, April.
  23. Aktin, Tülin & Özdemir, RIfat Gürcan, 2009. "An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing," European Journal of Operational Research, Elsevier, vol. 196(2), pages 737-743, July.
  24. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
  25. Beraldi, P. & Bruni, M.E. & Conforti, D., 2009. "The stochastic trim-loss problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 42-49, August.
  26. 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.
  27. Ruslan Sadykov & François Vanderbeck & Artur Pessoa & Issam Tahiri & Eduardo Uchoa, 2019. "Primal Heuristics for Branch and Price: The Assets of Diving Methods," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 251-267, April.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.