.png){kind=icon}
返回
SOLVING SEQUENTIAL INTERVAL CUTTING PROBLEMS VIA DYNAMIC-PROGRAMMING
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(92)90344-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new sequential one-dimensional cutting problem is studied in this paper. For a number of pieces of a tape or a bale has to be decided sequentially whether a piece is to be cut to smaller pieces of minimal/maximal length a and b, respectively, or if some part x is to be combined with some part y of the next piece. These parts must have a minimal length c and their sum should not be less than a nor greater than b. A cutting solution is needed which minimizes the unusable rest. A dynamic programming approach is offered in the paper to this problem as well as a modification. Real-life problems of cutting curtain bales have been solved by a corresponding PASCAL program on a personal computer.
Keyword:
DYNAMIC PROGRAMMING
CUTTING
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
.png){kind=icon}
