SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 4, Issue 4, 1984, Pages 373-395

A new polynomial-time algorithm for linear programming

(1) Karmarkar, N a

a LUCENT TECHNOLOGIES (United States)

Author keywords

AMS subject classification (1980): 90C05

Indexed keywords

EID: 51249181779 PISSN: 02099683 EISSN: 14396912 Source Type: Journal
DOI: 10.1007/BF02579150 Document Type: Article

Times cited : (2842)

References (7)

1
- 84932552095
- H. S. M. Coxeter, Introduction to Geometry, Wiley (1961).

2
- 0003909736
- Princeton University Press, Princeton, NJ
- (1963) Linear Programming and Extensions
- Dantzig, G.B.¹

3
- 51249185617
- The Ellipsoid Method and its Consequences in Combinatorial Optimization
- (1981) Combinatorica , vol.1 , pp. 169-197
- Grötschel, M.¹ Lovász, L.² Schrijver, A.³

4
- 0000564361
- A polynomial Algorithm in Linear Programming
- (1979) Doklady Akademii Nauk SSSR , vol.244 , Issue.S , pp. 1093-1096
- Khachiyan, L.G.¹

5
- 0001849163
- How good is the simplex algorithm?
- O., Shisha, Academic Press, New York
- (1972) Inequalities III , pp. 159-179
- Klee, V.¹ Minty, G.L.²

6
- 0004256857
- Blaisdell, New York
- (1938) Projective Geometry, 1–2
- Veblen, O.¹ Young, J.W.²

7
- 84932512336
- R. J. Walker, Algebraic Curves, Princeton University Press (1950).

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