Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16c.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier8JMKD3MGP8W/35HL36S
Repositorysid.inpe.br/mtc-m18@80/2009/06.26.15.13   (restricted access)
Last Update2009:06.26.15.13.38 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m18@80/2009/06.26.15.13.39
Metadata Last Update2020:04.28.17.48.42 (UTC) administrator
Secondary KeyINPE--PRE/
DOI10.1016/j.cor.2008.11.015
ISSN0305-0548
Citation KeyCorreaLoreRibe:2009:DeApPr
TitleA decomposition approach for the probabilistic maximal covering location-allocation problem
Year2009
MonthOct.
Access Date2024, Apr. 28
Secondary TypePRE PI
Number of Files1
Size604 KiB
2. Context
Author1 Correa, Francisco de Assis
2 Lorena, Luiz Antonio Nogueira
3 Ribeiro, G. M.
Resume Identifier1
2 8JMKD3MGP5W/3C9JHMQ
Group1 LAC-CTE-INPE-MCT-BR
2 LAC-CTE-INPE-MCT-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais (INPE)
2 Instituto Nacional de Pesquisas Espaciais (INPE)
JournalComputers and Operations Research
Volume36
Number10
Pages2729-2739
Secondary MarkA_ADMINISTRAÇÃO,_CIÊNCIAS_CONTÁBEIS_E_TURISMO A_ARQUITETURA_E_URBANISMO A_ENGENHARIAS_I A_ENGENHARIAS_II A_ENGENHARIAS_III A_ENGENHARIAS_IV A_INTERDISCIPLINAR B_CIÊNCIA_DA_COMPUTAÇÃO B_MATEMÁTICA_/_PROBABILIDADE_E_ESTATÍSTICA
History (UTC)2009-06-26 15:14:07 :: simone -> administrator ::
2010-05-11 01:08:41 :: administrator -> simone ::
2011-05-20 23:15:01 :: simone -> administrator ::
2020-04-28 17:48:42 :: administrator -> simone :: 2009
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsLocation problems
Lagrangean relaxation
Congested systems
Column generation
AbstractThe maximal covering location problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability. like the probabilistic model for the maximum covering location-allocation with a constraint in waiting time or queue length for congested systems, with one or more servers per service center. This paper presents a solution procedure for that probabilistic model, considering one server per center, using a column generation and covering graph approaches. The computational tests report interesting results for network instances up to 818 vertices. The column generation results are competitive solving the instances in reasonable computational times, reaching optimality for some and providing good bounds for the difficult instances.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A decomposition approach...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filea decomposition.pdf
User Groupadministrator
simone
Visibilityshown
Archiving Policydenypublisher denyfinaldraft36
Read Permissiondeny from all and allow from 150.163
5. Allied materials
Mirror Repositorysid.inpe.br/mtc-m18@80/2008/03.17.15.17.24
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES.
Host Collectionsid.inpe.br/mtc-m18@80/2008/03.17.15.17
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel documentstage e-mailaddress electronicmailaddress format isbn label lineage mark nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup rightsholder schedulinginformation secondarydate session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype
7. Description control
e-Mail (login)simone
update 


Close