| 显式与或图的多项式搜索算法 |
| |
| 引用本文： | 谢青松.显式与或图的多项式搜索算法[J].山东理工大学学报,1999(2). |
| |
| 作者姓名： | 谢青松 |
| |
| 作者单位： | 山东工程学院信息与电气学院 |
| |
| 摘 要： | 本文给出了两个显式含圈与或图的多项式搜索算法Fsg和FBG,并与其他算法的相应结果进行了比较,FBG算法性能更好.
|
| 关 键 词： | 问题归约 组合优化 代价与或图 最佳解图 贪心技术 |
Polynomial Search Algorithms for Explicit AND / OR Graphs |
| |
| Xie Qingsong.Polynomial Search Algorithms for Explicit AND / OR Graphs[J].Journal of Shandong University of Technology:Science and Technology,1999(2). |
| |
| Authors: | Xie Qingsong |
| |
| Institution: | College of Information and Electricity |
| |
| Abstract: | Tow new polynomial search algorithms, Fsg and Fbg, for explicit AND/ OR Graphsare proposed in this paper and computration result of which compared with relevant results of other algorithms, Fbg is proved better. |
| |
| Keywords: | Problem reduction Comoined optimization weignted AND/OR grapn Best solution graph Reedy technology |
| 本文献已被 CNKI 等数据库收录！ |
