The Lagrangian relaxation is a well known technique which provides bounds for integer programs through penalty adjustments. We give an overview of the method and illustrate its application to multi-period network design.