Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier6qtX3pFwXQZsFDuKxG/APgGz
Repositorysid.inpe.br/marciana/2004/01.19.11.14   (restricted access)
Last Update2004:07.15.03.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/marciana/2004/01.19.11.14.21
Metadata Last Update2018:06.05.01.20.50 (UTC) administrator
Secondary KeyINPE-10796-PRE/6252
ISBN/ISSN0305-0548
ISSN0305-0548
Citation KeyLorenaSenn:2004:CoGeAp
TitleA column generation approach to capacitated p-median problems
ProjectOtimização combinatória
Year2004
MonthMay
Access Date2024, Apr. 28
Secondary TypePRE PI
Number of Files1
Size472 KiB
2. Context
Author1 Lorena, Luiz Antonio Nogueira
2 Senne, Edson Luiz França
Resume Identifier1 8JMKD3MGP5W/3C9JHMQ
Group1 LAC-INPE-MCT-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado Computação e Matemática Aplicada (INPE.LAC)
2 Universidade Estadual Paulista, Faculdade Engenharia, Departamento de Matemática (UNESP.FEG)
JournalComputers and Operations Research
Volume31
Number6
Pages863-876
History (UTC)2005-06-13 13:01:53 :: jefferson -> administrator ::
2018-06-05 01:20:50 :: administrator -> marciana :: 2004
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsCOMPUTER SCIENCE
Capacitated p-median problems
Columns
Lagrangian function
Relaxation method (mathematics)
Median (statistics)
COMPUTAÇÃO APLICADA
Problemas de capacitação da p-mediana
Colunas
Função lagrangeana
Método de relaxação (matemática)
Mediana (estatística)
AbstractThe Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation approach to CPMP. The identified restricted master problem optimizes the covering of 1-median clusters satisfying the capacity constraints, and new columns are generated considering knapsack subproblems. The Lagrangean/surrogate relaxation has been used recently to accelerate subgradient like methods. In this work the Lagrangean/surrogate relaxation is directly identified from the master problem dual and provides new bounds and new productive columns through a modified knapsack subproblem. The overall column generation process is accelerated, even when multiple pricing is observed. Computational tests are presented using instances taken from real data from São José dos Campos’ city.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A column generation...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filelorena.pdf
User Groupadministrator
Visibilityshown
Copy HolderSID/SCD
Archiving Policydenypublisher denyfinaldraft36
Read Permissiondeny from all and allow from 150.163
5. Allied materials
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES.
Host Collectionsid.inpe.br/banon/2003/08.15.17.40
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyright creatorhistory descriptionlevel documentstage doi e-mailaddress electronicmailaddress format isbn label lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype
7. Description control
e-Mail (login)marciana
update 


Close