Improved Lagrangian bounds and heuristics for the generalized assignment problem
Nenhuma Miniatura disponível
Data
2017-09-01
Autores
Litvinchev, I. [UNESP]
Mata, M. [UNESP]
Saucedo, J. [UNESP]
Rangel, S. [UNESP]
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
Modified Lagrangian bounds are proposed for the generalized assignment problem. The approach is based on a double decomposable structure of the formulation. A family of greedy heuristics is considered to get Lagrangian based feasible solutions. Numerical results for problem instances with number of agents close to number of tasks are provided.
Descrição
Palavras-chave
Como citar
Journal of Computer and Systems Sciences International, v. 56, n. 5, p. 803-809, 2017.