We introduce two specific design problems of optical fiber cable networks that differ by a practical maintenance constraint. An integer programming based method including valid inequalities is introduced for the unconstrained problem. We propose two exact solution methods to tackle the constrained problem: the first one is based on mixed integer programming including valid inequalities while the second one is built on dynamic programming. The theoretical complexities of both problems in several cases are proven and compared. Numerical results assess the efficiency of both methods in different contexts including real-life instances, and evaluate the effect of the maintenance constraint on the solution quality