| Article ID: | iaor1993684 |
| Country: | Portugal |
| Volume: | 11 |
| Issue: | 1 |
| Start Page Number: | 52 |
| End Page Number: | 69 |
| Publication Date: | Jun 1991 |
| Journal: | Investigao Operacional |
| Authors: | Azevedo Jos A., Martins Ernesto Q.V. |
| Keywords: | decision theory: multiple criteria, programming: multiple criteria |
In this paper a new algorithm for the determination of the set of nondominated paths in an acyclic network is presented. The algorithm is based on a ranking path procedure and is supported by the Principle of Optimality. Computational experience is reported showing the superiority of this new approach over other alternative techniques, namely in terms of execution time and memory requirements.