We deal with the Regenerator Location Problem in optical networks. We are given a network G = (V,E), and a set Q of communication requests between pairs of terminals in V . We investigate two variations: one in which we are given a routing P of the requests in Q, and one in which we are required to find also the routing. In both cases, each path in P must contain a regenerator after every d edg...