Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/7912
DC FieldValueLanguage
dc.contributor.authorDias, Joana-
dc.contributor.authorCaptivo, M.-
dc.contributor.authorClímaco, João-
dc.date.accessioned2009-02-17T10:47:36Z-
dc.date.available2009-02-17T10:47:36Z-
dc.date.issued2008en_US
dc.identifier.citationCentral European Journal of Operations Research. 16:3 (2008) 251-280en_US
dc.identifier.urihttp://hdl.handle.net/10316/7912-
dc.description.abstractAbstract In this paper a capacitated dynamic location problem with opening, closure and reopening of facilities is formulated and a primal-dual heuristic that can solve this problem is described. The problem formulated considers the situation where a facility is open (or reopens) with a certain maximum capacity that decreases as clients are assigned to that facility during its operating periods. This problem is NP-hard. Computational results are presented and discussed.en_US
dc.language.isoengeng
dc.rightsopenAccesseng
dc.titleA dynamic location problem with maximum decreasing capacitiesen_US
dc.typearticleen_US
dc.identifier.doi10.1007/s10100-008-0055-1en_US
item.grantfulltextopen-
item.languageiso639-1en-
item.fulltextCom Texto completo-
crisitem.author.deptFaculdade de Ciências e Tecnologia, Universidade de Coimbra-
crisitem.author.parentdeptUniversidade de Coimbra-
crisitem.author.researchunitCenter for Mathematics, University of Coimbra-
crisitem.author.orcid0000-0001-6655-8590-
Appears in Collections:FEUC- Artigos em Revistas Internacionais
Files in This Item:
File Description SizeFormat
obra.pdf290.77 kBAdobe PDFView/Open
Show simple item record

Page view(s)

152
checked on Sep 16, 2019

Download(s) 50

481
checked on Sep 16, 2019

Google ScholarTM

Check

Altmetric

Dimensions


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.