An improved typology of cutting and packing problems
By Gerhard Wäscher, Heike Haußner, Holger Schumann. European Journal of Operational Research, 2007
1,570 citations recorded by the source corpus.
Subfields: Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/94613b94d626ae93e29fa1c5ca0f26efd5ab2965
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Industrial and Manufacturing Engineering
- Manuel Iori
- Silvano Martello
- Maxence Delorme
- Teodor Gabriel Crainic
- Thibaut Vidal
- Michel Gendreau
- Michael Drexl
Citations in the corpus
- Routing problems with loading constraints (2010, background): “and Finke [41], and later updated by Wäscher, Haußner and Schumann [91].”
- The load planning problem for double-stack intermodal trains (2017, background): “The load planning problem may be viewed as a special case of the packing-cutting-knapsack problems (Martello and Toth, 1990; Dowsland and Dowsland, 1992; Dyckhoff et al., 1997; Wäscher et al., 2007).”
- Bin packing and cutting stock problems: Mathematical models and exact algorithms (2016, methodology): “[154] re-visited the typology by Dyckhoff [50] and proposed more detailed categorization criteria: the problems we consider are classified as 1-dimensional SBSBPP (Single Bin Size Bin Packing Problem) and 1-dimensional SSSCSP (Single Stock Size Cutting Stock Problem).”