Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/10091
Title: Finding non-dominated bicriteria shortest pairs of disjoint simple paths
Authors: Clímaco, João C. N. 
Pascoal, Marta M. B. 
Keywords: Disjoint paths; Shortest simple paths; Bicriteria; Ranking algorithms
Issue Date: 30-Apr-2009
Citation: Computers & Operations Research. In Press, Corrected Proof:
URI: https://hdl.handle.net/10316/10091
DOI: 10.1016/j.cor.2009.01.002
Rights: openAccess
Appears in Collections:FEUC- Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
ficheiro.pdf439.93 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

11
checked on Sep 23, 2024

WEB OF SCIENCETM
Citations

7
checked on Sep 2, 2024

Page view(s)

341
checked on Sep 10, 2024

Download(s) 10

1,575
checked on Sep 10, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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