Cutting Stock Problem
The Cutting Stock Problem is a combinatorial optimization problem in which the objective is to determine the minimum number of standard-sized stock materials required to satisfy a given set of demand items, while minimizing waste through optimal cutting patterns.
394
Publications
23.7K
Citations
642
Authors
339
Institutions
Publications per year
2017–2026
62
Parents
394
The Theory and Computation of Knapsack Functions
Paul C. Gilmore, Ralph E. Gomory · Operations Research · 1966 · 607 citations
1–5 of 394
642
17
h-index
13
h-index
Universidade Estadual Paulista (Unesp), Brazil
14 publications · 461 citations
13
h-index
Universidade Estadual Paulista (Unesp), Brazil
11 publications · 373 citations
11
h-index
10
h-index
1–5 of 642
339
Technische Universität Dresden
Dresden, Germany
17 h-index
40 publications
1.9K citations
Universidade Estadual Paulista (Unesp)
São Paulo, Brazil
16 h-index
46 publications
1.5K citations
Universidade de São Paulo
São Paulo, Brazil
15 h-index
28 publications
1.7K citations

Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
14 h-index
25 publications
997 citations
University of Minho
Braga, Portugal
14 h-index
29 publications
1.8K citations
Guangxi University
Nanning, China
10 h-index
37 publications
773 citations
Brazilian Society of Computational and Applied Mathematics
São Carlos, Brazil
9 h-index
18 publications
1.1K citations

Centre National de la Recherche Scientifique
Paris, France
8 h-index
9 publications
713 citations
1–8 of 339
68 publications · 5.9K citations
39
h-index
OR · 30 publications · 1.2K citations
22
h-index
29 publications · 1.5K citations
22
h-index
23 publications · 6.4K citations
21
h-index
16 publications · 521 citations
14
h-index
1–5