Use dynamic programming to build guillotine cutting mode based on three-dimensional unbounded knapsack
碩士 === 國立勤益科技大學 === 工業工程與管理系 === 102 === In the guillotine cutting related study, In recent years, still mainly one-dimensional and two-dimensional problems, The main reason is guillotine cutting belong to NP-hard problem leads to solving problems, which increases the difficulty of solving the facto...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/87622678630821828701 |