中文摘要：

研究Hamming距离下树型网络的最短路改进问题，通过把该问题转化为0-1整数线性规划问题并通过求解有限个小规模0-1整数线性规划问题并求解．该研究方法在一定程度上推广了已有的结果．该问题的研究有助于设计求解一般的Hamming距离下的最短路改进问题的有效近似算法．

英文摘要：

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 ot 0-1 integer lin- ear programming and then finding the solutions for finite amount of small-scale 0-1 integer linear program- ming 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.