Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/14424
DC FieldValueLanguage
dc.contributor.authorMartins, Ernesto de Queirós Vieira-
dc.contributor.authorPascoal, Marta Margarida Braz-
dc.contributor.authorSantos, José Luís Esteves-
dc.date.accessioned2011-01-28T16:29:10Z-
dc.date.available2011-01-28T16:29:10Z-
dc.date.issued2001-
dc.identifier.citationMARTINS, Ernesto de Queirós Vieira; PASCOAL, Marta Madalena Braz; SANTOS, José Luís Esteves- A new improvement for a K shortest paths algorithm. "Investigação Operacional". ISSN 0874-5161. Vol. 21 (2001) 47-60-
dc.identifier.issn0874-5161-
dc.identifier.urihttps://hdl.handle.net/10316/14424-
dc.language.isoengpor
dc.publisherAPDIO - Associação Portuguesa de Investigação Operacionalpor
dc.rightsopenAccesspor
dc.subjectPathpor
dc.subjectRankingpor
dc.subjectDeletion path algorithmspor
dc.titleA new improvement for a K shortest paths algorithmpor
dc.typearticlepor
degois.publication.firstPage47por
degois.publication.lastPage60por
degois.publication.locationLisboapor
degois.publication.titleInvestigação Operacionalpor
dc.peerreviewedYespor
degois.publication.volume21por
uc.controloAutoridadeSim-
item.fulltextCom Texto completo-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextopen-
item.languageiso639-1en-
item.openairetypearticle-
item.cerifentitytypePublications-
crisitem.author.deptFaculty of Sciences and Technology-
crisitem.author.parentdeptUniversity of Coimbra-
crisitem.author.researchunitCMUC - Centre for Mathematics of the University of Coimbra-
crisitem.author.researchunitCMUC - Centre for Mathematics of the University of Coimbra-
crisitem.author.orcid0000-0003-0517-677X-
crisitem.author.orcid0000-0002-2727-6774-
Appears in Collections:FCTUC Matemática - Artigos em Revistas Nacionais
Files in This Item:
File Description SizeFormat
A new improvement for a K shortest paths algorithm.pdf188.84 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check


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