Incompletely Enumerative Solution for 1D Cutting-Stock Problem
文献类型：期刊论文
| 作者 | Song X(宋翔); Nie YY(聂义勇); Gui G(贵刚) |
| 刊名 | Far East Journal of Mathematical Sciences
 |
| 出版日期 | 2002 |
| 卷号 | 5期号:1页码:25-46 |
| 关键词 | 1D cutting-stock incomplete enumeration integer programming column generation knapsack problem multiple objectives |
| ISSN号 | 0972-0871 |
| 产权排序 | 1 |
| 中文摘要 | This paper analyzes the linear programming method for 1D cutting-stock problem, and presents and argues an incompletely enumerative solution. With the incomplete enumeration of single-cutting-modes, the optimal cutting-stock mode is approximately obtained under lower computational cost. Some numerical experiments show us the conclusion. A complete mathematical model of 1D cutting-stock problem is presented at the end of paper. |
| 语种 | 英语 |
| 公开日期 | 2012-05-29 |
| 源URL | [http://ir.sia.cn/handle/173321/6918]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室_先进制造技术研究室 |
| 推荐引用方式 GB/T 7714 | Song X,Nie YY,Gui G. Incompletely Enumerative Solution for 1D Cutting-Stock Problem[J]. Far East Journal of Mathematical Sciences,2002,5(1):25-46. |
| APA | Song X,Nie YY,&Gui G.(2002).Incompletely Enumerative Solution for 1D Cutting-Stock Problem.Far East Journal of Mathematical Sciences,5(1),25-46. |
| MLA | Song X,et al."Incompletely Enumerative Solution for 1D Cutting-Stock Problem".Far East Journal of Mathematical Sciences 5.1(2002):25-46. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。