SCOPUS 정보 검색 플랫폼

Volumn 47, Issue 3, 1999, Pages 445-448

O(nm)-time network simplex algorithm for the shortest path problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES;

TIME NETWORK SIMPLEX ALGORITHMS;

CRITICAL PATH ANALYSIS;

EID: 0032626769 PISSN: 0030364X EISSN: None Source Type: Journal
DOI: 10.1287/opre.47.3.445 Document Type: Article

Times cited : (14)

References (14)

1
- 0346803832
- A simple parallel tree contraction algorithm
- Abrahamson, K., N. Dadoun, D. G. Kirkpatrick, T. Przytycka. 1989. A simple parallel tree contraction algorithm. J. Algorithms 10 287-302.
- (1989) J. Algorithms , vol.10 , pp. 287-302
- Abrahamson, K.¹ Dadoun, N.² Kirkpatrick, D.G.³ Przytycka, T.⁴

2
- 0003515463
- Prentice-Hall, Englewood Cliffs, NJ
- Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
- (1993) Network Flows: Theory, Algorithms, and Applications
- Ahuja, R.K.¹ Magnanti, T.L.² Orlin, J.B.³

3
- 0039118333
- Technical Report. Dept. of Computer Sciences and Operations Research Program, North Carolina State University, Raleigh, NC
- Akgül, M. 1986. Shortest paths and the simplex method. Technical Report. Dept. of Computer Sciences and Operations Research Program, North Carolina State University, Raleigh, NC.
- (1986) Shortest Paths and the Simplex Method
- Akgül, M.¹

4
- 0002610737
- On a route problem
- Bellman, R. 1958. On a route problem. Quart. Appl. Math. 16 87-90.
- (1958) Quart. Appl. Math. , vol.16 , pp. 87-90
- Bellman, R.¹

5
- 34250381328
- A network simplex method
- Cunningham, W. 1976. A network simplex method. Math. Programming 11 105-116.
- (1976) Math. Programming , vol.11 , pp. 105-116
- Cunningham, W.¹

6
- 0018464747
- Theoretical properties of the network simplex method
- _. 1979. Theoretical properties of the network simplex method. Math. Oper. Res. 4 196-208.
- (1979) Math. Oper. Res. , vol.4 , pp. 196-208

7
- 0001366593
- Discrete-variable extremum principles
- Dantzig, G. B. 1957. Discrete-variable extremum principles. Oper. Res. 5 266-277.
- (1957) Oper. Res. , vol.5 , pp. 266-277
- Dantzig, G.B.¹

8
- 0003870959
- The Rand Corporation Report Santa Monica, CA
- Ford, L. R. 1956. Network Flow Theory. The Rand Corporation Report P-923, Santa Monica, CA.
- (1956) Network Flow Theory , pp. 923
- Ford, L.R.¹

9
- 0025456249
- Efficient shortest path simplex algorithms
- Goldfarb, D., J. Hao, S. Kai. 1990a. Efficient shortest path simplex algorithms. Oper. Res. 38 624-628.
- (1990) Oper. Res. , vol.38 , pp. 624-628
- Goldfarb, D.¹ Hao, J.² Kai, S.³

10
- 84987014269
- Anti-stalling pivot rules for the network simplex algorithm
- _,_,_. 1990b. Anti-stalling pivot rules for the network simplex algorithm. Networks 20 79-91.
- (1990) Networks , vol.20 , pp. 79-91

11
- 0003558735
- Holt, Rinehart and Winston, New York
- Lawler, E. L. 1979. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
- (1979) Combinatorial Optimization: Networks and Matroids
- Lawler, E.L.¹

12
- 0344461964
- A variant on the shortest route problem
- Minty, G. J. 1958. A variant on the shortest route problem. Oper. Res. 6 882.
- (1958) Oper. Res. , vol.6 , pp. 882
- Minty, G.J.¹

13
- 0001860685
- The shortest path through a maze
- Moore, Z. F. 1957. The shortest path through a maze. Proc. Internat. Sympos. on Theory of Switching, Part II. 285-292.
- (1957) Proc. Internat. Sympos. on Theory of Switching, Part II , pp. 285-292
- Moore, Z.F.¹

14
- 0031210693
- A polynomial time primal network simplex algorithm
- Orlin, J. B. 1997. A polynomial time primal network simplex algorithm. Math. Programming-B 78 109-129.
- (1997) Math. Programming-B , vol.78 , pp. 109-129
- Orlin, J.B.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.