|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2008, Volume 48, Number 5, Pages 779–787
(Mi zvmmf136)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Comparison of Lagrangian bounds for one class of generalized assignment problems
I. S. Litvincheva, S. Rangelb a Dorodnicyn Computing Center, Russian Academy of Sciences,
ul. Vavilova 40, Moscow, 119991, Russia
b Sao Paulo State University, CP 136, S.J., Rio Preto, Brazil
Abstract:
Classical 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.
Key words:
Lagrangian bounds in optimization problems, improvement of Lagrangian bounds, generalized assignment problem.
Received: 31.07.2007
Citation:
I. S. Litvinchev, S. Rangel, “Comparison of Lagrangian bounds for one class of generalized assignment problems”, Zh. Vychisl. Mat. Mat. Fiz., 48:5 (2008), 779–787; Comput. Math. Math. Phys., 48:5 (2008), 739–746
Linking options:
https://www.mathnet.ru/eng/zvmmf136 https://www.mathnet.ru/eng/zvmmf/v48/i5/p779
|
|