摘要
给出了一种新的能找出含圈与或图的最佳解图的算法，证明了其正确性，并分析了其复杂性．
A new marking algorithm called BTS is presented, which finds out optimal cost solutions of an explicit AND/OR graph, even though it contains cycles. The algorithm'scorrectness is strictly proved,and its complexity is briefly analysed.
出处
《山东大学学报（自然科学版）》
CSCD
1996年第3期298-304,共7页
Journal of Shandong University(Natural Science Edition)
关键词
组合优化
人工智能
显示与或图
搜索算法
problem reduction
combinatorial optimization
weighted AND/OR graph
best solution graph
greedy technology
