Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/10091
DC FieldValueLanguage
dc.contributor.authorClímaco, João C. N.-
dc.contributor.authorPascoal, Marta M. B.-
dc.date.accessioned2009-04-30T13:58:20Z-
dc.date.available2009-04-30T13:58:20Z-
dc.date.issued2009-04-30T13:58:20Z-
dc.identifier.citationComputers & Operations Research. In Press, Corrected Proof:en_US
dc.identifier.urihttps://hdl.handle.net/10316/10091-
dc.description.urihttp://www.sciencedirect.com/science/article/B6VC5-4VBDKNX-1/2/b7e59602a9fb4eb885f498b0d8c779ccen_US
dc.language.isoengeng
dc.rightsopenAccesseng
dc.subjectDisjoint pathsen_US
dc.subjectShortest simple pathsen_US
dc.subjectBicriteriaen_US
dc.subjectRanking algorithmsen_US
dc.titleFinding non-dominated bicriteria shortest pairs of disjoint simple pathsen_US
dc.typearticleen_US
dc.identifier.doi10.1016/j.cor.2009.01.002-
item.fulltextCom Texto completo-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypearticle-
item.grantfulltextopen-
item.cerifentitytypePublications-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.researchunitCMUC - Centre for Mathematics of the University of Coimbra-
crisitem.author.orcid0000-0001-6655-8590-
crisitem.author.orcid0000-0003-0517-677X-
Appears in Collections:FEUC- Artigos em Revistas Internacionais
Files in This Item:
File Description SizeFormat
ficheiro.pdf439.93 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

11
checked on Jul 15, 2024

WEB OF SCIENCETM
Citations

6
checked on Jul 2, 2024

Page view(s)

337
checked on Jul 16, 2024

Download(s) 10

1,567
checked on Jul 16, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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