Shortest Path and Network Flow Algorithms-Reference-Cited by-同舟云学术

Shortest Path and Network Flow Algorithms

Published:1979 Issue: Volume: Page:251-263
ISSN:0167-5060
Container-title:Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium
language:
Short-container-title:

Author:

Lawler Eugene L.

Publisher

Elsevier

Reference33 articles.

1. F. Glover and D. Klingman;Barr;An improved version of the out-of-kilter method and a comparative study of cumputer codes, Math. Programming,1974

2. Programming, Games and Transportation Networks;Berge,1976

3. J.H. Bookbinder and S.P. Sethi, The dynamic transportation problem: A survey, Working paper, Faculty of Management Studies, University of Toronto (1977).

4. Survey of deterministic networks;Bradley;AIIE Trans.,1975

5. G.G. Brown and G.L. Graves;Bradley;Design and implementation of large scale primal transshipment algorithms, Management Sci.,1977

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asynchronous transfer mode networks with parallel links and multiple service classes;European Journal of Operational Research;2003-04

2. The Pyramidal Method for Traveling Salesman Problem;Communications - Scientific letters of the University of Zilina;2000-12-31

3. The partial sum criterion for Steiner trees in graphs and shortest paths;European Journal of Operational Research;1997-02

4. An algorithm for the ranking of shortest paths;European Journal of Operational Research;1993-08

5. Polynomial-time primal simplex algorithms for the minimum cost network flow problem;Algorithmica;1992-12