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 35 articles , 1 standard article )

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

1 2 next

  1. Brandão, Filipe; Pedroso, João Pedro: Bin packing and related problems: general arc-flow formulation with graph compression (2016)
  2. Delorme, Maxence; Iori, Manuel; Martello, Silvano: Bin packing and cutting stock problems: mathematical models and exact algorithms (2016)
  3. Martinovic, J.; Scheithauer, G.: Integer linear programming models for the skiving stock problem (2016)
  4. Poldi, Kelly Cristina; de Araujo, Silvio Alexandre: Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (2016)
  5. Cui, Yaodong; Zhong, Cheng; Yao, Yi: Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost (2015)
  6. Silva, Elsa; Oliveira, José F.; Wäscher, Gerhard: 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (2014)
  7. Aloisio, Alessandro; Arbib, Claudio; Marinelli, Fabrizio: On LP relaxations for the pattern minimization problem (2011)
  8. Aloisio, Alessandro; Arbib, Claudio; Marinelli, Fabrizio: Cutting stock with no three parts per pattern: work-in-process and pattern minimization (2011)
  9. Matsumoto, Kazuki; Umetani, Shunji; Nagamochi, Hiroshi: On the one-dimensional stock cutting problem in the paper tube industry (2011)
  10. Puchinger, Jakob; Stuckey, Peter J.; Wallace, Mark G.; Brand, Sebastian: Dantzig-Wolfe decomposition and branch-and-price solving in G12 (2011)
  11. Alem, Douglas José; munari, Pedro Augusto; Arenales, Marcos Nereu; Ferreira, Paulo Augusto Valente: On the cutting stock problem under stochastic demand (2010)
  12. Clautiaux, François; Alves, Cláudio; Valério de Carvalho, José: A survey of dual-feasible and superadditive functions (2010)
  13. Kiwiel, Krzysztof C.: An inexact bundle approach to cutting-stock problems (2010)
  14. Moungla, Nora Touati; Létocart, L.; Nagih, A.: Solutions diversification in a column generation algorithm (2010)
  15. Alves, Cláudio; Macedo, Rita; Valério de Carvalho, José M.: New lower bounds based on column generation and constraint programming for the pattern minimization problem (2009)
  16. Kiwiel, K.C.; Lemaréchal, C.: An inexact bundle variant suited to column generation (2009)
  17. Poldi, Kelly Cristina; Arenales, Marcos Nereu: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (2009)
  18. Alves, Cláudio; Valério de Carvalho, J.M.: A branch-and-price-and-cut algorithm for the pattern minimization problem (2008)
  19. Briant, O.; Lemaréchal, C.; Meurdesoif, Ph.; Michel, S.; Perrot, N.; Vanderbeck, F.: Comparison of bundle and classical column generation (2008)
  20. Moretti, Antonio Carlos; de Salles Neto, Luiz Leduíno: Nonlinear cutting stock problem model to minimize the number of different patterns and objects (2008)

1 2 next