Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/44383
Title: Bicriteria path problem minimizing the cost and minimizing the number of labels
Authors: Pascoal, Marta 
Captivo, M. Eugénia 
Clímaco, João 
Laranjeira, Ana 
Issue Date: 2013
Publisher: Springer
Issue Date: 2013
Publisher: Springer
Abstract: We address a bicriterion path problem where each arc is assigned with a cost value and a label (such as a color). The first criterion intends to minimize the total cost of the path (the summation of its arc costs), while the second intends to get the solution with a minimal number of different labels. Since these criteria, in general, are conflicting criteria we develop an algorithm to generate the set of non-dominated paths. Computational experiments are presented and results are discussed.
URI: http://hdl.handle.net/10316/44383
Other Identifiers: 10.1007/s10288-013-0229-0
DOI: 10.1007/s10288-013-0229-0
Rights: embargoedAccess
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
2013PascoalEtAl.pdf199.7 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

1
checked on Jun 25, 2019

WEB OF SCIENCETM
Citations

1
checked on Jun 25, 2019

Page view(s)

179
checked on Aug 19, 2019

Download(s) 50

440
checked on Aug 19, 2019

Google ScholarTM

Check

Altmetric

Altmetric


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