메뉴 건너뛰기




Volumn 39, Issue 16, 2006, Pages 4161-4171

Possible sets of autocorrelations and the Simplex algorithm

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33645656529     PISSN: 03054470     EISSN: 13616447     Source Type: Journal    
DOI: 10.1088/0305-4470/39/16/004     Document Type: Article
Times cited : (2)

References (16)
  • 6
    • 84972521846 scopus 로고
    • The generalized simplex method for minimizing a linear form under
    • Dantzig G B, Orden A and Wolfe P 1955 The generalized simplex method for minimizing a linear form under Pac. J. Math. 5 183-95
    • (1955) Pac. J. Math. , vol.5 , pp. 183-195
    • Dantzig, G.B.1    Orden, A.2    Wolfe, P.3
  • 10
    • 0001900752 scopus 로고
    • Maximization of a linear function of variables subject to linear inequalities
    • Dantzig G B 1951 Maximization of a linear function of variables subject to linear inequalities Activity Analysis of Production and Allocation ed T C Koopmans (New York: Wiley)
    • (1951) Activity Analysis of Production and Allocation
    • Dantzig, G.B.1
  • 11
    • 0001849163 scopus 로고
    • How good is the simplex algorithm?
    • Klee V and Minty G J 1972 How good is the simplex algorithm? Inequalities III ed O Shisha (New York: Academic)
    • (1972) Inequalities III
    • Klee, V.1    Minty, G.J.2


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