SCOPUS 정보 검색 플랫폼

Volumn 78, Issue 2, 1997, Pages 131-148

A new strongly polynomial dual network simplex algorithm

Author keywords

Dual simplex algorithm; Minimum cost network flow problem; Network simplex algorithm

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; POLYNOMIALS;

DUAL NETWORK SIMPLEX ALGORITHM; MINIMUM COST NETWORK FLOW PROBLEM;

ALGORITHMS;

EID: 0031207599 PISSN: 00255610 EISSN: None Source Type: Journal
DOI: 10.1007/BF02614366 Document Type: Article

Times cited : (19)

References (11)

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

2
- 38249008209
- Solving linear bottleneck assignment problems via strong spanning trees
- R.D. Armstrong and Z. Jin. Solving linear bottleneck assignment problems via strong spanning trees, Operations Research Letters 12 (1992) 179-180.
- (1992) Operations Research Letters , vol.12 , pp. 179-180
- Armstrong, R.D.¹ Jin, Z.²

3
- 0039095231
- Strongly polynomial simplex method for bipartite vertex packing
- R.D. Armstrong and Z. Jin, Strongly polynomial simplex method for bipartite vertex packing, Discrete Applied Mathematics 64 (1996) 97-103.
- (1996) Discrete Applied Mathematics , vol.64 , pp. 97-103
- Armstrong, R.D.¹ Jin, Z.²

4
- 0022676208
- A competitive (dual) simplex method for the assignment problem
- M.L. Balinski, A competitive (dual) simplex method for the assignment problem, Mathematical Programming 34 (1986) 125-141.
- (1986) Mathematical Programming , vol.34 , pp. 125-141
- Balinski, M.L.¹

5
- 84986959310
- Maximum matching in bipartite graphs via strong spanning trees
- M.L. Balinski and J. Gonzalez, Maximum matching in bipartite graphs via strong spanning trees, Networks 21 (1991) 165-179.
- (1991) Networks , vol.21 , pp. 165-179
- Balinski, M.L.¹ Gonzalez, J.²

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

7
- 0015330635
- Theoretical improvements in algorithmic efficiency for network flow problems
- J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, Journal of ACM 19 (1972) 248-264.
- (1972) Journal of ACM , vol.19 , pp. 248-264
- Edmonds, J.¹ Karp, R.M.²

8
- 0022160968
- Efficient dual simplex algorithms for the assignment problem
- D. Goldfarb, Efficient dual simplex algorithms for the assignment problem, Mathematical Programming 33 (1985) 187-203.
- (1985) Mathematical Programming , vol.33 , pp. 187-203
- Goldfarb, D.¹

9
- 0027554501
- A faster strongly polynomial minimum cost flow algorithm
- J.B. Orlin, A faster strongly polynomial minimum cost flow algorithm, Operations Research 41 (1993) 338-350.
- (1993) Operations Research , vol.41 , pp. 338-350
- Orlin, J.B.¹

10
- 34250079590
- Polynomial dual network simplex algorithms
- J.B. Orlin, S.A. Plotkin and E. Tardos, Polynomial dual network simplex algorithms, Mathematical Programming 60 (1993) 255-276.
- (1993) Mathematical Programming , vol.60 , pp. 255-276
- Orlin, J.B.¹ Plotkin, S.A.² Tardos, E.³

11
- 51249170715
- A strongly polynomial minimum cost circulation algorithm
- E. Tardos, A strongly polynomial minimum cost circulation algorithm, Combinatorica 5 (1985) 247-255.
- (1985) Combinatorica , vol.5 , pp. 247-255
- Tardos, E.¹

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