Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/45060
DC FieldValue
dc.titleA multicriteria Pareto-optimal path algorithm
dc.contributor.authorTung Tung, C.
dc.contributor.authorLin Chew, K.
dc.date.accessioned2013-10-10T05:02:24Z
dc.date.available2013-10-10T05:02:24Z
dc.date.issued1992
dc.identifier.citationTung Tung, C.,Lin Chew, K. (1992). A multicriteria Pareto-optimal path algorithm. European Journal of Operational Research 62 (2) : 203-209. ScholarBank@NUS Repository.
dc.identifier.issn03772217
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/45060
dc.description.abstractIn this paper we present an algorithm for finding, in a multicriteria network, Pareto-optimal paths, one each for each efficient objective vector. Validation of the algorithm and two illustrative examples are included. Computational experience is also reported. This algorithm is a generalization of an earlier one for the bicriterion case. © 1992.
dc.sourceScopus
dc.subjectalgorithm
dc.subjectheuristics
dc.subjectmulticriteria Pareto-optimal path
dc.subjectNetwork
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.contributor.departmentDECISION SCIENCES
dc.description.sourcetitleEuropean Journal of Operational Research
dc.description.volume62
dc.description.issue2
dc.description.page203-209
dc.description.codenEJORD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

236
checked on Jun 23, 2022

Google ScholarTM

Check


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