Multiperiod capacity expansion of a telecommunications connection with uncertain demand

We consider multiperiod capacity expansion of a telecommunications connection with uncertain demand. We present a new processing rule which drastically reduces computation time of an existing algorithm for a two-stage formulation of the problem. Also, an alternative multistage formulation of the problem is given and we elaborate a recursive solution procedure. Both algorithms have been implemented in C++, and we present the results of a series of computational experiments, demonstrating the effect of the new preprocessing rule and the practicability of the multistage procedure.