| Article ID: | iaor20014151 |
| Country: | China |
| Volume: | 18 |
| Issue: | 1 |
| Start Page Number: | 28 |
| End Page Number: | 31 |
| Publication Date: | Mar 2000 |
| Journal: | Henan Science |
| Authors: | Wang Qing, Yang Aifeng, Lin Hao |
Let G be a digraph. The two-objective optimal path problem is to find a path which has the maximum weight and minimum cost in G. In this paper, we transfer the two-objective optimal path problem to one-objective problem by some mathematical models, from which we obtain the effective solutions.