This paper revises the CRCS algorithm proposed by Yang1. In the constrained range search, we use the cost and performance of candidate links to obtain the exact link range of the optimal solution. Moreover, we use the concept of variable dominance to reduce the number of candidate links without loss of optimality. A comparison of results obtained using Yang's and the revised CRCS algorithm shows that the revised CRCS algorithm is superior to Yang's original version.
