Improved Lagrangean decomposition: An application to the generalized assignment problem

Recently two new ways of obtaining improved Lagrangean bounds have been suggested: Lagrangean decomposition and bound improving sequences. In this work the authors will obtain a Lagrangean approach combining the two ideas mentioned above. Theoretical results are provided about the sharpness of the bounds obtained by the combined approach for the general case as well as an application to the generalized assignment problem. Computational experience is reported.