A column generation approach for the maximal covering location problem
Nenhuma Miniatura disponível
Data
2007-01-01
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Artigo
Direito de acesso
Resumo
This article presents a column generation algorithm to calculate new improved lower bounds to the solution of maximal covering location problems formulated as a p-median problem. This reformulation leads to instances that are difficult for column generation methods. The traditional column generation method is compared with the new approach, where the reduced cost criterion used at the column selection is modified by a Lagrangean/surrogate multiplier. The efficiency of the new approach is tested with real data, where computational tests were conducted and showed the impact of sparsity and degeneracy on column generation-based methods. © 2017 Wiley. All rights reserved.
Descrição
Palavras-chave
Idioma
Inglês
Como citar
International Transactions in Operational Research, v. 14, n. 4, p. 349-364, 2007.