Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/44947
DC FieldValue
dc.titleFinding integer efficient solutions for bicriteria and tricriteria network flow problems using dinas
dc.contributor.authorMustafa, A.
dc.contributor.authorGoh, M.
dc.date.accessioned2013-10-10T04:38:25Z
dc.date.available2013-10-10T04:38:25Z
dc.date.issued1998
dc.identifier.citationMustafa, A.,Goh, M. (1998). Finding integer efficient solutions for bicriteria and tricriteria network flow problems using dinas. Computers and Operations Research 25 (2) : 139-157. ScholarBank@NUS Repository.
dc.identifier.issn03050548
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/44947
dc.description.abstractThis article describes a method for adjusting into integral form the noninteger compromise solutions obtained via DINAS to interactively solve the bicriteria and tricriteria network flow problems. Utilizing the special properties of network flows, particularly the formation of a unique cycle associated with moving from an extreme point solution to its adjacent extreme point solution, the method only requires the observation and manipulation of the decision variable values of the compromise solutions. © 1998 Elsevier Science Ltd. All rights reserved.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentDECISION SCIENCES
dc.description.sourcetitleComputers and Operations Research
dc.description.volume25
dc.description.issue2
dc.description.page139-157
dc.description.codenCMORA
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.

Google ScholarTM

Check


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