| 瓶颈旅行售货员问题算法 |
| |
| 引用本文： | 曾庆红,杨桥艳.瓶颈旅行售货员问题算法[J].保山师专学报,2014(2):51-52,96. |
| |
| 作者姓名： | 曾庆红 杨桥艳 |
| |
| 作者单位： | 保山学院数学学院,云南保山678000 |
| |
| 基金项目： | 云南省应用基础研究计划项目（2013FD054）. |
| |
| 摘 要： | 旅行售货员问题是一个著名的组合优化问题,已经被证明是NP-完备问题。提出一个新问题:瓶颈旅行售货员问题,并给出两个多项式时间算法。
|
| 关 键 词： | 瓶颈旅行售货员问题 算法 时间复杂性 |
An Algorithm of The Bottleneck Traveling Salesman Problem |
| |
| Zeng Qinghong,Yang Qiaoyan.An Algorithm of The Bottleneck Traveling Salesman Problem[J].Journal of Baoshan Teachers' College,2014(2):51-52,96. |
| |
| Authors: | Zeng Qinghong Yang Qiaoyan |
| |
| Institution: | (School of Mathematics, Baoshan University, Baoshan, Yunnan 678000) |
| |
| Abstract: | Traveling Salesman Problem is a famous combinatorial optimization problem, and has proven to be NP complete problems. We defined a new problem： The Bottleneck Traveling Salesman Problem and propose two polynomial time algorithms. |
| |
| Keywords: | The Bottleneck Traveling Salesman Problem Algorithm Time Complexity |
| 本文献已被 CNKI 维普 等数据库收录！ |
