CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem. A problem generator for the Standard One-dimensional Cutting Stock Problem (1D-CSP) is developed. The problem is defined and its parameters are identified. Then it is shown what features have been included in the program in order to allow for the generation of easily reproducible random problem instances. Finally, by applying the generator a set of benchmark problems is identified.

References in zbMATH (referenced in 44 articles , 1 standard article )

Showing results 1 to 20 of 44.
Sorted by year (citations)

1 2 3 next

  1. Cerqueira, Gonçalo R. L.; Aguiar, Sérgio S.; Marques, Marlos: Modified greedy heuristic for the one-dimensional cutting stock problem (2021)
  2. Oliveira, Washington A.; Fiorotto, Diego J.; Song, Xiang; Jones, Dylan F.: An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem (2021)
  3. Rahman, Hamidur; Mahajan, Ashutosh: On the facet defining inequalities of the mixed-integer bilinear covering set (2020)
  4. Ma, Ning; Liu, Ya; Zhou, Zhili: Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (2019)
  5. Rahman, Hamidur; Mahajan, Ashutosh: Facets of a mixed-integer bilinear covering set with bounds on variables (2019)
  6. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  7. Martinovic, J.; Scheithauer, G.; Valério de Carvalho, J. M.: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (2018)
  8. Tomat, Luka; Gradišar, Mirko: One-dimensional stock cutting: optimization of usable leftovers in consecutive orders (2017)
  9. Brandão, Filipe; Pedroso, João Pedro: Bin packing and related problems: general arc-flow formulation with graph compression (2016)
  10. Delorme, Maxence; Iori, Manuel; Martello, Silvano: Bin packing and cutting stock problems: mathematical models and exact algorithms (2016)
  11. Martinovic, J.; Scheithauer, G.: Integer linear programming models for the skiving stock problem (2016)
  12. Neidlein, Vera; Scholz, André; Wäscher, Gerhard: SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects (2016)
  13. Poldi, Kelly Cristina; de Araujo, Silvio Alexandre: Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (2016)
  14. Cui, Yaodong; Zhong, Cheng; Yao, Yi: Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost (2015)
  15. Silva, Elsa; Oliveira, José F.; Wäscher, Gerhard: 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (2014)
  16. Aloisio, Alessandro; Arbib, Claudio; Marinelli, Fabrizio: Cutting stock with no three parts per pattern: work-in-process and pattern minimization (2011)
  17. Aloisio, Alessandro; Arbib, Claudio; Marinelli, Fabrizio: On LP relaxations for the pattern minimization problem (2011)
  18. Matsumoto, Kazuki; Umetani, Shunji; Nagamochi, Hiroshi: On the one-dimensional stock cutting problem in the paper tube industry (2011)
  19. Puchinger, Jakob; Stuckey, Peter J.; Wallace, Mark G.; Brand, Sebastian: Dantzig-Wolfe decomposition and branch-and-price solving in G12 (2011)
  20. Alem, Douglas José; Munari, Pedro Augusto; Arenales, Marcos Nereu; Ferreira, Paulo Augusto Valente: On the cutting stock problem under stochastic demand (2010)

1 2 3 next