A branch-and-price approach to p-median location problems

dc.contributor.authorSenne, Edson Luiz França [UNESP]
dc.contributor.authorLorena, LAN
dc.contributor.authorPereira, M. A.
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.contributor.institutionInstituto Nacional de Pesquisas Espaciais (INPE)
dc.date.accessioned2014-05-20T13:27:57Z
dc.date.available2014-05-20T13:27:57Z
dc.date.issued2005-06-01
dc.description.abstractThis paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is minimized. The traditional column generation process is compared with a stabilized approach that combines the column generation and Lagrangean/surrogate relaxation. The Lagrangean/surrogate multiplier modifies; the reduced cost criterion, providing the selection of new productive columns at the search tree. Computational experiments are conducted considering especially difficult instances to the traditional column generation and also with some large-scale instances. (C) 2004 Elsevier Ltd. All rights reserved.en
dc.description.affiliationSão Paulo State Univ, FEG, UNESP, Dept Math,Engn Sch, BR-12500000 Guaratingueta, SP, Brazil
dc.description.affiliationBrazilian Space Res Inst, LAC, INPE, BR-12201970 Sao Jose Dos Campos, Brazil
dc.description.affiliationUnespSão Paulo State Univ, FEG, UNESP, Dept Math,Engn Sch, BR-12500000 Guaratingueta, SP, Brazil
dc.format.extent1655-1664
dc.identifierhttp://dx.doi.org/10.1016/j.cor.2003.11.024
dc.identifier.citationComputers & Operations Research. Oxford: Pergamon-Elsevier B.V., v. 32, n. 6, p. 1655-1664, 2005.
dc.identifier.doi10.1016/j.cor.2003.11.024
dc.identifier.issn0305-0548
dc.identifier.lattes1338008237590056
dc.identifier.lattes9386730770147178
dc.identifier.orcid0000-0002-6544-2964
dc.identifier.urihttp://hdl.handle.net/11449/9271
dc.identifier.wosWOS:000225907500014
dc.language.isoeng
dc.publisherElsevier B.V.
dc.relation.ispartofComputers & Operations Research
dc.relation.ispartofjcr2.962
dc.relation.ispartofsjr1,916
dc.rights.accessRightsAcesso restrito
dc.sourceWeb of Science
dc.subjectp-medianpt
dc.subjectcolumn generationpt
dc.subjectLagrangean/surrogate relaxationpt
dc.subjectbranch and pricept
dc.titleA branch-and-price approach to p-median location problemsen
dc.typeArtigo
dcterms.licensehttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dcterms.rightsHolderElsevier B.V.
unesp.author.lattes1338008237590056
unesp.author.lattes9386730770147178[1]
unesp.author.orcid0000-0002-6544-2964[1]
unesp.campusUniversidade Estadual Paulista (Unesp), Faculdade de Engenharia, Guaratinguetápt

Arquivos

Licença do Pacote
Agora exibindo 1 - 1 de 1
Nenhuma Miniatura disponível
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição: