| 一种新的显式与或图搜索算法 |
| |
| 引用本文： | 谢青松,马绍汉.一种新的显式与或图搜索算法[J].山东大学学报(理学版),1996(3). |
| |
| 作者姓名： | 谢青松 马绍汉 |
| |
| 作者单位： | Dept.of COmputer Science，Shandong Univ.，Jinan |
| |
| 摘 要： | 给出了一种新的能找出含圈与或图的最佳解图的算法，证明了其正确性，并分析了其复杂性．
|
| 关 键 词： | 问题归约 组合优化 代价与或图 最佳解图 贪心技术 |
A NEW ALGORTHM FOR SEARCHING EXPLICIT AND/OR GRAPHS |
| |
| Xie Qingsong,Ma Shaohan.A NEW ALGORTHM FOR SEARCHING EXPLICIT AND/OR GRAPHS[J].Journal of Shandong University,1996(3). |
| |
| Authors: | Xie Qingsong Ma Shaohan |
| |
| Abstract: | 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. |
| |
| Keywords: | problem reduction combinatorial optimization weighted AND/OR graph best solution graph greedy technology |
| 本文献已被 CNKI 等数据库收录！ |
