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.
-- Wikipedia
-
Notifications
You must be signed in to change notification settings - Fork 0
delarco/2d-cutting-stock
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A 2D cutting stock problem solver in Python.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published