| Article ID: | iaor19961048 |
| Country: | Netherlands |
| Volume: | 62 |
| Issue: | 2 |
| Start Page Number: | 203 |
| End Page Number: | 209 |
| Publication Date: | Oct 1992 |
| Journal: | European Journal of Operational Research |
| Authors: | Chew Kim Lin, Tung Chi Tung |
| Keywords: | networks: path |
In this paper the authors 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. The algorithm is a generalization of an earlier one for the bicriterion case.