Summary: The multi-period degree constrained minimum spanning tree problem (MP-DCMSTP) is defined in terms of a finite discretized planning horizon, an edge weighted undirected graph \(G\), degree bounds and latest installation dates assigned to the vertices of \(G\). Since vertices must be connected to a root node no later than their latest installation dates and edges’ weights are non-increasing over time, the problem asks for optimally choosing and scheduling edges’ installation over the planning horizon, enforcing connectivity of the solution at each time period, so that in the end of the planning horizon, a degree constrained spanning tree of \(G\) is found. We show that the decision version of a combinatorial relaxation for the problem, that of finding a multi-period minimum spanning tree problem (MP-MSTP), is NP-complete. We propose a new integer programming formulation for MP-DCMSTP that is at least as good as the multi-commodity flow formulation in the literature. We also introduce some new valid inequalities which allowed our strengthened formulation to produce the strongest known bounds to date. Two MP-DCMSTP exact algorithms exploring the strengthened formulation are introduced here. One of them, RCBC, is a hybrid method involving two phases, the first being a Lagrangian relax-and-cut method that works as a pre-processor procedure to the second phase, a branch-and-cut algorithm. The other approach, SRCBC, uses RCBC to solve a sequence of smaller MP-DCMSTP instances generated from the original one in the hope of solving the latter faster. Our computational results indicate that SRCBC solves more instances to proven optimality, generally in one fourth of the time taken by RCBC to solve similar instances. For those instances left unsolved by both, SRCBC also provided much better feasible solutions within the same CPU time limit.