A Lagrangian bound for many-to-many assignment problems
Carregando...
Fontes externas
Fontes externas
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Springer
Springer Nature
Springer Nature
Tipo
Artigo
Direito de acesso
Acesso restrito
Fontes externas
Fontes externas
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
Idioma
Inglês
Citação
Journal of Combinatorial Optimization. Dordrecht: Springer, v. 19, n. 3, p. 241-257, 2010.
