haku: @journal_id 1478 / yhteensä: 17
viite: 6 / 17
| Tekijä: | Oyama, T. |
| Otsikko: | Weight of shortest path analyses for the optimal location problem |
| Lehti: | Journal of the Operations Research Society of Japan
2000 : MAR, VOL. 43:1, p. 176-196 |
| Asiasana: | JAPAN LOCATION PROBLEM ECONOMICS |
| Kieli: | eng |
| Tiivistelmä: | In this paper the author considers the shortest path counting problem (SPCP): how many shortest paths contain each edge of the network N = (V, E) with the vertex set V and the edge set E? There are n(n - 1) shortest paths in the network with ÄVÅ = n, so among all these shortest paths th SPCP requires us to count the number of shortest paths passing each edge. Defining the weight of shortest paths for each of explicit expressions for special types of networks. |
SCIMA