IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v29y1981i6p1092-1104.html
   My bibliography  Save this item

A New Linear Programming Approach to the Cutting Stock Problem

Citations

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


Cited by:

  1. Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
  2. Martinovic, J. & Scheithauer, G., 2016. "Integer linear programming models for the skiving stock problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 356-368.
  3. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie & Andreas Fischer, 2019. "Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation," 4OR, Springer, vol. 17(2), pages 173-200, June.
  4. Martinovic, J. & Scheithauer, G. & Valério de Carvalho, J.M., 2018. "A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 458-471.
  5. Song, X. & Chu, C.B. & Nie, Y.Y. & Bennell, J.A., 2006. "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1870-1889, December.
  6. Jianyu Long & Zhong Zheng & Xiaoqiang Gao & Panos M. Pardalos & Wanzhe Hu, 2020. "An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem," Annals of Operations Research, Springer, vol. 289(2), pages 291-311, June.
  7. 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.
  8. Antonio, Julien & Chauvet, Fabrice & Chu, Chengbin & Proth, Jean-Marie, 1999. "The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming," European Journal of Operational Research, Elsevier, vol. 114(2), pages 395-402, April.
  9. John Martinovic, 2022. "A note on the integrality gap of cutting and skiving stock instances," 4OR, Springer, vol. 20(1), pages 85-104, March.
  10. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
  11. 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.
  12. Harald Dyckhoff & Rainer Souren, 2023. "Are important phenomena of joint production still being neglected by economic theory? A review of recent literature," Journal of Business Economics, Springer, vol. 93(6), pages 1015-1053, August.
  13. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
  14. Alexander Abuabara & Reinaldo Morabito, 2009. "Cutting optimization of structural tubes to build agricultural light aircrafts," Annals of Operations Research, Springer, vol. 169(1), pages 149-165, July.
  15. Jie Fang & Yunqing Rao & Qiang Luo & Jiatai Xu, 2023. "Solving One-Dimensional Cutting Stock Problems with the Deep Reinforcement Learning," Mathematics, MDPI, vol. 11(4), pages 1-16, February.
  16. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
  17. Degraeve, Zeger & Gochet, Willy & Jans, Raf, 2002. "Alternative formulations for a layout problem in the fashion industry," European Journal of Operational Research, Elsevier, vol. 143(1), pages 80-93, November.
  18. Silva, Elsa & Alvelos, Filipe & Valério de Carvalho, J.M., 2010. "An integer programming model for two- and three-stage two-dimensional cutting stock problems," European Journal of Operational Research, Elsevier, vol. 205(3), pages 699-708, September.
  19. Pedroso, João Pedro, 2020. "Heuristics for packing semifluids," European Journal of Operational Research, Elsevier, vol. 282(3), pages 823-834.
  20. Zeger Degraeve & Martina Vandebroek, 1998. "A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry," Management Science, INFORMS, vol. 44(3), pages 301-310, March.
  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. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie, 2022. "An introduction to stochastic bin packing-based server consolidation with conflicts," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 296-331, July.
  23. 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.
  24. John Martinovic & Guntram Scheithauer, 2018. "Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case," Annals of Operations Research, Springer, vol. 271(2), pages 811-829, December.
  25. Fabio Furini & Enrico Malaguti & Dimitri Thomopulos, 2016. "Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 736-751, November.
  26. Keehoon Kwon & Doyeong Kim & Sunkuk Kim, 2021. "Cutting Waste Minimization of Rebar for Sustainable Structural Work: A Systematic Literature Review," Sustainability, MDPI, vol. 13(11), pages 1-21, May.
  27. Rapine, Christophe & Pedroso, Joao Pedro & Akbalik, Ayse, 2022. "The two-dimensional knapsack problem with splittable items in stacks," Omega, Elsevier, vol. 112(C).
  28. 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.
  29. 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.
  30. Daniel Adelman & George L. Nemhauser, 1999. "Price-Directed Control of Remnant Inventory Systems," Operations Research, INFORMS, vol. 47(6), pages 889-898, December.
  31. Dongho Lee & Seunghyun Son & Doyeong Kim & Sunkuk Kim, 2020. "Special-Length-Priority Algorithm to Minimize Reinforcing Bar-Cutting Waste for Sustainable Construction," Sustainability, MDPI, vol. 12(15), pages 1-15, July.
  32. Harald Dyckhoff, 2023. "Proper modelling of industrial production systems with unintended outputs: a different perspective," Journal of Productivity Analysis, Springer, vol. 59(2), pages 173-188, April.
  33. Arbib, Claudio & Marinelli, Fabrizio, 2005. "Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application," European Journal of Operational Research, Elsevier, vol. 163(3), pages 617-630, June.
  34. 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.
  35. Zeger Degraeve & Linus Schrage, 1999. "Optimal Integer Solutions to Industrial Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 406-419, November.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.