메뉴 건너뛰기




Volumn 43, Issue 1, 2000, Pages 149-161

On network simplex method using the primal-dual symmetric pivoting rule

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0034147978     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.43.149     Document Type: Article
Times cited : (6)

References (14)
  • 2
    • 0002706294 scopus 로고
    • The scaling network simplex algorithm
    • R. K. Ahuja and J. B. Orlin: The scaling network simplex algorithm. Operations Research, 40, Supplement 1 (1992) S5-S13.
    • (1992) Operations Research , vol.40 , Issue.SUPPL. 1
    • Ahuja, R.K.1    Orlin, J.B.2
  • 3
    • 0031207599 scopus 로고    scopus 로고
    • A strongly polynomial dual network simplex algorithm
    • R. Armstrong and Z. Jin: A strongly polynomial dual network simplex algorithm. Mathematical Programming, 78 (1997) 131-148.
    • (1997) Mathematical Programming , vol.78 , pp. 131-148
    • Armstrong, R.1    Jin, Z.2
  • 4
    • 0002224079 scopus 로고
    • The alternating path basis algorithm for the assignment problem
    • R. S. Barr, F. Glove, and D. Klingman: The alternating path basis algorithm for the assignment problem. Mathematical Programming Study, 13 (1977) 1-13.
    • (1977) Mathematical Programming Study , vol.13 , pp. 1-13
    • Barr, R.S.1    Glove, F.2    Klingman, D.3
  • 7
    • 0003346462 scopus 로고
    • Application of the simplex method to a transportation problem
    • In T. C. Koopmans (eds.): Wiley, New York
    • G. B. Dantzig: Application of the simplex method to a transportation problem. In T. C. Koopmans (eds.): Activity Analysis and Production and Allocation (Wiley, New York, 1951), 209-213.
    • (1951) Activity Analysis and Production and Allocation , pp. 209-213
    • Dantzig, G.B.1
  • 8
    • 0002251357 scopus 로고
    • On the shortest route through a network
    • G. B. Dantzig: On the shortest route through a network. Management Science, 6 (1960) 187-190.
    • (1960) Management Science , vol.6 , pp. 187-190
    • Dantzig, G.B.1
  • 9
    • 0002206342 scopus 로고    scopus 로고
    • Resolution of the problem of degeneracy in a primal and dual simplex algorithm
    • K. Dosios, and K. Paparrizos: Resolution of the problem of degeneracy in a primal and dual simplex algorithm. Operations Research Letters, 20 (1997) 45-50.
    • (1997) Operations Research Letters , vol.20 , pp. 45-50
    • Dosios, K.1    Paparrizos, K.2
  • 10
    • 0025456249 scopus 로고
    • Efficient shortest path simplex algorithms
    • D. Goldfarb, J. Hao, and S. Kai: Efficient shortest path simplex algorithms. Operations Research, 38 (1990) 624-628.
    • (1990) Operations Research , vol.38 , pp. 624-628
    • Goldfarb, D.1    Hao, J.2    Kai, S.3
  • 11
    • 0000408490 scopus 로고
    • Networks and basic solutions
    • E. L. Johnson: Networks and basic solutions. Operations Research, 14 (1966) 619-624.
    • (1966) Operations Research , vol.14 , pp. 619-624
    • Johnson, E.L.1
  • 13
    • 0031210693 scopus 로고    scopus 로고
    • A polynomial time primal network simplex algorithm for minimum cost flows
    • J. B. Orlin: A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming, 78 (1997) 109-129.
    • (1997) Mathematical Programming , vol.78 , pp. 109-129
    • Orlin, J.B.1


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