Please use this identifier to cite or link to this item:
|Title:||Finding integer efficient solutions for bicriteria and tricriteria network flow problems using dinas|
|Source:||Mustafa, 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.|
|Abstract:||This 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.|
|Source Title:||Computers and Operations Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 15, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.