This monograph is concerned with network restoration problems to ensure telecommunication network survivability. More precisely, the author studies the problems of determining minimum cost link capacities in order to satisfy a given set of requirements, that is the network synthesis problem, restoration of which is a special application. The author illustrates the role that combinatorial optimization techniques can play in the solutions of various classes of synthesis problem encountered in telecommunication planning. The author presents a literature review, mathematical formulations, and a complexity analysis. Lower bounds, and exact solutions for some classes of this problem are provided. Furthermore, she develops a tabu search heuristic for finding good approximate solutions for real size instances. The monograph also provides an introduction to SDH/SONET telecommunication networks and to various survivability techniques.