The cutting-stock problem (CSP) has many applications in the production planning of many industries such as the metallurgy, plastics, paper, glass, furniture and textile. In general, cutting stock problems are based on cutting unlimited large pieces of length c into a set of smaller items with demand vi and length wi while optimizing a certain objective function. The objective function can be minimizing waste, maximizing the profit, minimizing cost, minimizing the number of items used, etc. The CSP has many practical applications in real-life problems and is easy to formulate. However, these problems are difficult to solve since they are in NP-hard. Therefore, it is important to solve these problems efficiently so that the production expenses are lower as much as possible.
-
Notifications
You must be signed in to change notification settings - Fork 0
KruglovaOlga/my_CSP
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published