摘要
板材的最优切割算法是一种穷举搜索寻求最优解的算法。该算法用回溯法将原本复杂的问题转换成几个子问题,并找出递归结束条件。用递归的程序设计方法求出所有的切割方案,记录下最优的切割方案。论文以印刷电路板的最优切割为例,详述了最优切割算法的设计与实现。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第18期95-96,共2页
Computer Engineering and Applications
关键词
板材
回溯法
递归
切割
Board,Backtracking,Recursion,Partition
