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

Authors

642

  1. GS
    Guntram Scheithauer

    Technische Universität Dresden, Germany

    17 publications · 914 citations

    17

    h-index

  2. JV
    José Valério de Carvalho

    University of Minho, Portugal

    13 publications · 1K citations

    13

    h-index

  3. SA
    Silvio Alexandre de Araújo

    Universidade Estadual Paulista (Unesp), Brazil

    14 publications · 461 citations

    13

    h-index

  4. AC
    Adriana Cristina Cherri

    Universidade Estadual Paulista (Unesp), Brazil

    11 publications · 373 citations

    11

    h-index

  5. JT
    Johannes Terno

    Technische Universität Dresden, Germany

    10 publications · 409 citations

    10

    h-index

1–5 of 642

Venues

  1. European Journal of Operational Research

    68 publications · 5.9K citations

    39

    h-index

  2. Journal of the Operational Research Society

    OR · 30 publications · 1.2K citations

    22

    h-index

  3. Computers & Operations Research

    29 publications · 1.5K citations

    22

    h-index

  4. Operations Research

    23 publications · 6.4K citations

    21

    h-index

  5. 14

    h-index

1–5