haku: @indexterm ALGORITHMS / yhteensä: 403
viite: 189 / 403
| Tekijä: | Divoky, J. J. Hung, M. S. |
| Otsikko: | Performance of shortest path algorithms in network flow problems. |
| Lehti: | Management Science
1990 : JUN, VOL. 36:6, p. 661-673 |
| Asiasana: | NETWORK ANALYSIS ALGORITHMS |
| Kieli: | eng |
| Tiivistelmä: | Minimum cost flow problems can be solved by successive augmentations along shortest paths. The issues of implementing shortest path algorithms are examined in context. Of particular interest is the dynamic topology that the flow networks exhibit. A network generator is developed capable of emulating such topology. Strategies for exploiting the special structures in such networks are discussed. A set of 9000 test problems is offered, from which a particular strategy/algorithm combination is shown. |
SCIMA