Studying properties of Lagrangian bounds for many-to-many assignment problems
Nenhuma Miniatura disponível
Data
2009-06-01
Autores
Litvinchev, I. [UNESP]
Rangel, S. [UNESP]
Mata, M. [UNESP]
Saucedo, J. [UNESP]
Título da Revista
ISSN da Revista
Título de Volume
Editor
Maik Nauka/interperiodica/springer
Resumo
Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.
Descrição
Palavras-chave
Como citar
Journal of Computer and Systems Sciences International. New York: Maik Nauka/interperiodica/springer, v. 48, n. 3, p. 363-369, 2009.