| Hamming距离下树型网络的最短路改进问题 |
| |
| 引用本文： | 张斌武,王勤. Hamming距离下树型网络的最短路改进问题[J]. 兰州理工大学学报, 2008, 34(2): 84-86 |
| |
| 作者姓名： | 张斌武 王勤 |
| |
| 作者单位： | 河海大学,数理部,江苏,常州,213022;中国计量学院,数学系,浙江,杭州,310018 |
| |
| 摘 要： | 研究Hamming距离下树型网络的最短路改进问题,通过把该问题转化为0-1整数线性规划问题并通过求解有限个小规模0-1整数线性规划问题并求解.该研究方法在一定程度上推广了已有的结果.该问题的研究有助于设计求解一般的Hamming距离下的最短路改进问题的有效近似算法.
|
| 关 键 词： | Hamming距离 最短路 NP-困难 0-1整数规划 |
| 文章编号： | 1673-5196(2008)02-0084-03 |
| 修稿时间： | 2007-10-19 |
Improvement of shortest path of arborescent network in the case of Hamming distance |
| |
| ZHANG Bin-wu,WANG Qin. Improvement of shortest path of arborescent network in the case of Hamming distance[J]. Journal of Lanzhou University of Technology, 2008, 34(2): 84-86 |
| |
| Authors: | ZHANG Bin-wu WANG Qin |
| |
| Abstract: | The problem of shortest path improvement of arborescent network was investigated in the case of Hamming distance.This problem was solved by means of converting it into a problem of 0-1 integer linear programming and then finding the solutions for finite amount of small-scale 0-1 integer linear programming problems.This algorithm generalized some algorithms available to some extent.The investigation of such problem was useful for designing some efficient approximate algorithms for shortest path improvement in the case of Hamming distance. |
| |
| Keywords: | Hamming distance shortest path NP-hardness 0-1 integer programming |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
