Litvinchev, I.Rangel, S. [UNESP]2014-05-202014-05-202008-05-01Computational Mathematics and Mathematical Physics. New York: Maik Nauka/interperiodica/springer, v. 48, n. 5, p. 739-746, 2008.0965-5425http://hdl.handle.net/11449/40884Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are examined. For the class of generalized assignment problems, this property of constraints is used to design a Benders algorithm for solving the modified dual problem. Numerical results are presented that compare the quality of classical and modified bounds.739-746engLagrangian bounds in optimization problemsimprovement of Lagrangian boundsgeneralized assignment problemArtigo10.1134/S0965542508050047WOS:000262334100004Acesso restrito