%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP
%@archivingpolicy denypublisher denyfinaldraft
%@issn 0969-6016
%@resumeid
%@resumeid 8JMKD3MGP5W/3C9JHMQ
%@usergroup administrator
%@usergroup rosemary
%@usergroup simone
%3 Pereira-lorena-senne-itor.pdf
%X This paper 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 results instances that are difficult for column generation methods. The traditional column generation method is compared to the new approach, where the reduced cost criterion employed 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.
%T A column generation approach for the maximal covering location problem
%@electronicmailaddress mapereira@feg.unesp.br
%@electronicmailaddress lorena@lac.inpe.br
%@electronicmailaddress elfsenne@feg.unesp.br
%@secondarytype PRE PI
%K Facility location, Column generation, Lagrangean/surrogate relaxation, COMPUTAÇÂO APLICADA.
%@visibility shown
%@group
%@group LAC-INPE-MCT-BR
%@secondarykey INPE--PRE/
%2 sid.inpe.br/mtc-m17@80/2007/06.05.10.36.01
%@affiliation Universidade Estadual Paulista (UNESP)
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%@affiliation Universidade Estadual Paulista (UNESP)
%B International Transactions in Operational Research
%4 sid.inpe.br/mtc-m17@80/2007/06.05.10.35
%D 2007
%V aceito
%A Pereira, M. A.,
%A Lorena, Luiz Antonio Nogueira,
%A Senne, E. L. F.,
%@dissemination WEBSCI; PORTALCAPES.
%@area COMP