Karmarkar's algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Karmarkar's algorithm" in English language version.

refsWebsite

Global rank English rank

12doi.org

2^nd place

8semanticscholar.org

11^th place

8^th place

5ams.org

451^st place

277^th place

3web.archive.org

1^st place

3princeton.edu

741^st place

577^th place

2nytimes.com

7^th place

1psu.edu

207^th place

136^th place

1worldcat.org

5^th place

1acm.org

1,185^th place

840^th place

1ibm.com

1,131^st place

850^th place

1cmu.edu

1,564^th place

1,028^th place

1andrewchin.com

low place

1apnews.com

129^th place

89^th place

1ffii.org

low place

acm.org

dl.acm.org

Karmarkar, N. (1984). "A new polynomial-time algorithm for linear programming". Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84. pp. 302–311. doi:10.1145/800057.808695. ISBN 0897911334. S2CID 13101261.

ams.org

mathscinet.ams.org

Strang, Gilbert (1 June 1987). "Karmarkar's algorithm and its place in applied mathematics". The Mathematical Intelligencer. 9 (2): 4–10. doi:10.1007/BF03025891. ISSN 0343-6993. MR 0883185. S2CID 123541868.
Karmarkar, Narendra (1990). "An interior-point approach to NP-complete problems. I". Mathematical developments arising from linear programming (Brunswick, ME, 1988). Contemporary Mathematics. Vol. 114. Providence, RI: American Mathematical Society. pp. 297–308. doi:10.1090/conm/114/1097880. ISBN 978-0-8218-5121-0. MR 1097880.
Karmarkar, Narendra (1990). "Riemannian geometry underlying interior-point methods for linear programming". Mathematical developments arising from linear programming (Brunswick, ME, 1988). Contemporary Mathematics. Vol. 114. Providence, RI: American Mathematical Society. pp. 51–75. doi:10.1090/conm/114/1097865. ISBN 978-0-8218-5121-0. MR 1097865.
Vanderbei, R. J.; Lagarias, J. C. (1990). "I. I. Dikin's convergence result for the affine-scaling algorithm". Mathematical developments arising from linear programming (Brunswick, ME, 1988) (PDF). Contemporary Mathematics. Vol. 114. Providence, RI: American Mathematical Society. pp. 109–119. doi:10.1090/conm/114/1097868. ISBN 978-0-8218-5121-0. MR 1097868.

ams.org

Margaret H. Wright (2004). "The Interior-Point Revolution in Optimization: History, Recent Developments, and Lasting Consequences" (PDF). Bulletin of the American Mathematical Society. 42: 39–56. doi:10.1090/S0273-0979-04-01040-7.

andrewchin.com

Andrew Chin (2009). "On Abstraction and Equivalence in Software Patent Doctrine: A Response to Bessen, Meurer and Klemens" (PDF). Journal of Intellectual Property Law. 16: 214–223.

apnews.com

"Military Is First Announced Customer Of AT&T Software". Associated Press. AP News. Retrieved 2019-06-11.

cmu.edu

cs.cmu.edu

Various posts by Matthew Saltzman, Clemson University

doi.org

Strang, Gilbert (1 June 1987). "Karmarkar's algorithm and its place in applied mathematics". The Mathematical Intelligencer. 9 (2): 4–10. doi:10.1007/BF03025891. ISSN 0343-6993. MR 0883185. S2CID 123541868.
Karmarkar, N. (1984). "A new polynomial-time algorithm for linear programming". Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84. pp. 302–311. doi:10.1145/800057.808695. ISBN 0897911334. S2CID 13101261.
Karmarkar, N. (1984). "A new polynomial-time algorithm for linear programming". Combinatorica. 4 (4): 373–395. doi:10.1007/BF02579150. S2CID 7257867.
Karmarkar, Narendra K. (1989). "Power Series Variants of Karmarkar-Type Algorithms". AT&T Technical Journal. 68 (3): 20–36. doi:10.1002/j.1538-7305.1989.tb00316.x. S2CID 42071587.
Karmarkar, Narendra (1990). "An interior-point approach to NP-complete problems. I". Mathematical developments arising from linear programming (Brunswick, ME, 1988). Contemporary Mathematics. Vol. 114. Providence, RI: American Mathematical Society. pp. 297–308. doi:10.1090/conm/114/1097880. ISBN 978-0-8218-5121-0. MR 1097880.
Karmarkar, Narendra (1990). "Riemannian geometry underlying interior-point methods for linear programming". Mathematical developments arising from linear programming (Brunswick, ME, 1988). Contemporary Mathematics. Vol. 114. Providence, RI: American Mathematical Society. pp. 51–75. doi:10.1090/conm/114/1097865. ISBN 978-0-8218-5121-0. MR 1097865.
Vanderbei, R. J.; Lagarias, J. C. (1990). "I. I. Dikin's convergence result for the affine-scaling algorithm". Mathematical developments arising from linear programming (Brunswick, ME, 1988) (PDF). Contemporary Mathematics. Vol. 114. Providence, RI: American Mathematical Society. pp. 109–119. doi:10.1090/conm/114/1097868. ISBN 978-0-8218-5121-0. MR 1097868.
Robert J. Vanderbei; Meketon, Marc; Freedman, Barry (1986). "A Modification of Karmarkar's Linear Programming Algorithm" (PDF). Algorithmica. 1 (1–4): 395–407. doi:10.1007/BF01840454. S2CID 779577.
Gill, Philip E.; Murray, Walter; Saunders, Michael A.; Tomlin, J. A.; Wright, Margaret H. (1986). "On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method". Mathematical Programming. 36 (2): 183–209. doi:10.1007/BF02592025. S2CID 18899771.
Margaret H. Wright (2004). "The Interior-Point Revolution in Optimization: History, Recent Developments, and Lasting Consequences" (PDF). Bulletin of the American Mathematical Society. 42: 39–56. doi:10.1090/S0273-0979-04-01040-7.
Marc S. Meketon; Y.C. Cheng; D.J. Houck; J.M.Liu; L. Slutsman; Robert J. Vanderbei; P. Wang (1989). "The AT&T KORBX System". AT&T Technical Journal. 68 (3): 7–19. doi:10.1002/j.1538-7305.1989.tb00315.x. S2CID 18548851.
Kennington, J.L. (1989). "Using KORBX for military airlift applications". Proceedings of the 28th IEEE Conference on Decision and Control. pp. 1603–1605. doi:10.1109/CDC.1989.70419. S2CID 60450719.

ffii.org

eupat.ffii.org

"今野浩: カーマーカー特許とソフトウェア – 数学は特許になるか (Konno Hiroshi: The Kamarkar Patent and Software – Has Mathematics Become Patentable?)". FFII. Archived from the original on 2008-06-27. Retrieved 2008-06-27.

ibm.com

researcher.watson.ibm.com

"Karmarkar Algorithm". IBM Research. Archived from the original on 2016-08-03.

nytimes.com

query.nytimes.com

Kolata, Gina (1989-03-12). "IDEAS & TRENDS; Mathematicians Are Troubled by Claims on Their Recipes". The New York Times.

nytimes.com

Markoff, John (13 August 1988). "Big A.T.&T. Computer for Complexities". The New York Times.

princeton.edu

vanderbei.princeton.edu

Vanderbei, R. J.; Lagarias, J. C. (1990). "I. I. Dikin's convergence result for the affine-scaling algorithm". Mathematical developments arising from linear programming (Brunswick, ME, 1988) (PDF). Contemporary Mathematics. Vol. 114. Providence, RI: American Mathematical Society. pp. 109–119. doi:10.1090/conm/114/1097868. ISBN 978-0-8218-5121-0. MR 1097868.

princeton.edu

Robert J. Vanderbei; Meketon, Marc; Freedman, Barry (1986). "A Modification of Karmarkar's Linear Programming Algorithm" (PDF). Algorithmica. 1 (1–4): 395–407. doi:10.1007/BF01840454. S2CID 779577.

orfe.princeton.edu

Lowenstein, Roger (15 August 1988). "AT&T markets problem solver, based on math whiz's find, for $8.9 million" (PDF). Wall Street Journal. Archived from the original (PDF) on 8 June 2016. Retrieved 30 January 2016.

psu.edu

citeseerx.ist.psu.edu

Arkadi Nemirovsky (2004). Interior point polynomial-time methods in convex programming.

semanticscholar.org

api.semanticscholar.org

Strang, Gilbert (1 June 1987). "Karmarkar's algorithm and its place in applied mathematics". The Mathematical Intelligencer. 9 (2): 4–10. doi:10.1007/BF03025891. ISSN 0343-6993. MR 0883185. S2CID 123541868.
Karmarkar, N. (1984). "A new polynomial-time algorithm for linear programming". Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84. pp. 302–311. doi:10.1145/800057.808695. ISBN 0897911334. S2CID 13101261.
Karmarkar, N. (1984). "A new polynomial-time algorithm for linear programming". Combinatorica. 4 (4): 373–395. doi:10.1007/BF02579150. S2CID 7257867.
Karmarkar, Narendra K. (1989). "Power Series Variants of Karmarkar-Type Algorithms". AT&T Technical Journal. 68 (3): 20–36. doi:10.1002/j.1538-7305.1989.tb00316.x. S2CID 42071587.
Robert J. Vanderbei; Meketon, Marc; Freedman, Barry (1986). "A Modification of Karmarkar's Linear Programming Algorithm" (PDF). Algorithmica. 1 (1–4): 395–407. doi:10.1007/BF01840454. S2CID 779577.
Gill, Philip E.; Murray, Walter; Saunders, Michael A.; Tomlin, J. A.; Wright, Margaret H. (1986). "On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method". Mathematical Programming. 36 (2): 183–209. doi:10.1007/BF02592025. S2CID 18899771.
Marc S. Meketon; Y.C. Cheng; D.J. Houck; J.M.Liu; L. Slutsman; Robert J. Vanderbei; P. Wang (1989). "The AT&T KORBX System". AT&T Technical Journal. 68 (3): 7–19. doi:10.1002/j.1538-7305.1989.tb00315.x. S2CID 18548851.
Kennington, J.L. (1989). "Using KORBX for military airlift applications". Proceedings of the 28th IEEE Conference on Decision and Control. pp. 1603–1605. doi:10.1109/CDC.1989.70419. S2CID 60450719.

web.archive.org

"Karmarkar Algorithm". IBM Research. Archived from the original on 2016-08-03.
Lowenstein, Roger (15 August 1988). "AT&T markets problem solver, based on math whiz's find, for $8.9 million" (PDF). Wall Street Journal. Archived from the original (PDF) on 8 June 2016. Retrieved 30 January 2016.
"今野浩: カーマーカー特許とソフトウェア – 数学は特許になるか (Konno Hiroshi: The Kamarkar Patent and Software – Has Mathematics Become Patentable?)". FFII. Archived from the original on 2008-06-27. Retrieved 2008-06-27.

worldcat.org

search.worldcat.org

Strang, Gilbert (1 June 1987). "Karmarkar's algorithm and its place in applied mathematics". The Mathematical Intelligencer. 9 (2): 4–10. doi:10.1007/BF03025891. ISSN 0343-6993. MR 0883185. S2CID 123541868.