| 板材最优切割算法的设计与实现 |
| |
| 引用本文： | 谭汉松,彭迎春.板材最优切割算法的设计与实现[J].计算机工程与应用,2003,39(18):95-96. |
| |
| 作者姓名： | 谭汉松 彭迎春 |
| |
| 作者单位： | 中南大学信息科学与工程学院,长沙,410083 |
| |
| 摘 要： | 板材的最优切割算法是一种穷举搜索寻求最优解的算法。该算法用回溯法将原本复杂的问题转换成几个子问题,并找出递归结束条件。用递归的程序设计方法求出所有的切割方案,记录下最优的切割方案。论文以印刷电路板的最优切割为例,详述了最优切割算法的设计与实现。
|
| 关 键 词： | 板材 回溯法 递归 切割 |
| 文章编号： | 1002-8331-(2003)18-0095-02 |
| 修稿时间： | 2002年5月1日 |
Design and Realization of the Best Partition Algorithm of Board |
| |
| Tan Hansong Peng Yingchun.Design and Realization of the Best Partition Algorithm of Board[J].Computer Engineering and Applications,2003,39(18):95-96. |
| |
| Authors: | Tan Hansong Peng Yingchun |
| |
| Abstract: | The best partition algorithm of board is an algorithm of seeking the best result with infinite search.This al-gorithm would transfer an originally complicated problem to several subproblems with backtracking and find out condi-tions of end.The authors should find out all results with recursion and record the best result in this algorithm.This pa per takes example for the best partition algorithm of PCB to discuss design and realization of the best partition algorithm. |
| |
| Keywords: | Board Backtracking Recursion Partition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
