A Lagrangian bound for many-to-many assignment problems
Nenhuma Miniatura disponível
Data
2010-04-01
Autores
Litvinchev, Igor
Rangel, Socorro
Saucedo, Jania
Título da Revista
ISSN da Revista
Título de Volume
Editor
Springer
Resumo
A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem into two subproblems. Second, it can be considered as a search for a tighter estimation of the penalty term arising in the Lagrangian problem. The new bounds are illustrated by a small example and studied numerically for a class of the generalized assignment problems.
Descrição
Palavras-chave
Lagrangian bounds, Integer programming, Many-to-many-assignment problem
Como citar
Journal of Combinatorial Optimization. Dordrecht: Springer, v. 19, n. 3, p. 241-257, 2010.