| 用贪心算法求解最优服务次序问题 |
| |
| 引用本文： | 李洪霞,于仁师,史新梁,邓立苗.用贪心算法求解最优服务次序问题[J].适用技术之窗,2008(3):18-20. |
| |
| 作者姓名： | 李洪霞 于仁师 史新梁 邓立苗 |
| |
| 作者单位： | 青岛农业大学信息科学与工程学院,山东青岛266109 |
| |
| 摘 要： | 贪心算法是解决问题的一类重要方法,因其简单、直观和高效而受到人们的重视。特别是对于具有最优子结构和贪心选择性质的一类实际问题,它可以通过一系列局部最优选择来获得整体最优解。本文首先对最优服务次序问题进行了分析,然后给出了该问题的贪心解法,最后对所提出算法的时间复杂度进行了分析。
|
| 关 键 词： | 贪心算法 最优选择 最优服务次序 复杂度 |
The Greedy Algorithm to Optimum Serve Order |
| |
| Li Hongxia Yu Renshi Shi Xinliang Deng Limiao.The Greedy Algorithm to Optimum Serve Order[J].Science & Technology Plaza,2008(3):18-20. |
| |
| Authors: | Li Hongxia Yu Renshi Shi Xinliang Deng Limiao |
| |
| Affiliation: | Li Hongxia Yu Renshi Shi Xinliang Deng Limiao(College of Information Science and Engineering,Qingdao Agriculture University,Shandong Qingdao 266109) |
| |
| Abstract: | The Greedy algorithm is one of the most important methods to solve problems. It is simple and high-efficient to some problems with optimum substructure property and greedy selection property. It gets the totally optimal solution by a series of locally optimal selections. In this paper, the optimization problem of serve order is analyzed firstly, and then an efficient algorithm is presented based on greedy algorithm. Lastly, the time complexity of the presented algorithm is analyzed. |
| |
| Keywords: | Greedy Algorithm Optimal Selection Optimum Serve Order Complexity |
| 本文献已被 维普 等数据库收录！ |
