Common · History
Cutting stock problem
Mathematical problem in operations research
In operations research, the cutting-stock problem is the problem of cutting standard-sized pieces of stock material, such as paper rolls or sheet metal, into pieces of specified sizes while minimizing material wasted. It is an optimization problem in mathematics that arises from applications in industry.
From Wikipedia
In operations research, the cutting-stock problem is the problem of cutting standard-sized pieces of stock material, such as paper rolls or sheet metal, into pieces of specified sizes while minimizing material wasted. It is an optimization problem in mathematics that arises from applications in industry. In terms of computational complexity, the problem is an NP-hard problem reducible to the knapsack problem. The problem can be formulated as an integer linear programming problem.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
★★
Optimization problem
Problems involving the selection of an optimal element from sets of available alternatives
-
★★
Mathematical problem
Problem that can be possibly solved via mathematics
-
B★★
Bin packing problem
Operations research problem of packing items into the fewest bins
-
K★★
Karp's 21 NP-complete problems
Set of computational problems
-
★
Undecidable problem
Decision problem for which it is impossible to construct an algorithm that always leads to a correct yes-or-no answer
-
★★
Wicked problem
Problem that is difficult or impossible to solve because of incomplete, contradictory, and changing requirements that are often difficult to recognize