Linear programming (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Linear programming" in English language version.

Last modified: 12:57:37, 7 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

1712doi.org

2^nd place

96semanticscholar.org

15^th place

8^th place

64ams.org

434^th place

249^th place

53web.archive.org

1^st place

53worldcat.org

4^th place

44arxiv.org

49^th place

31^st place

42psu.edu

299^th place

159^th place

33jstor.org

23^rd place

15^th place

31dtic.mil

934^th place

530^th place

22sourceforge.net

1,842^nd place

1,520^th place

11adsabs.harvard.edu

14^th place

9^th place

11britannica.com

37^th place

64^th place

11googleusercontent.com

144^th place

3,076^th place

11strath.ac.uk

low place

6,381^st place

11mit.edu

476^th place

340^th place

11lehigh.edu

low place

7,353^rd place

11in-ter-trans.eu

low place

11aaai.org

low place

6,393^rd place

aaai.org (Global: low place; English: 6,393^rd place)

http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/viewFile/1769/2076 Archived 2011-06-29 at the Wayback Machine OptimJ used in an Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

von Neumann, J. (1945). "A Model of General Economic Equilibrium". The Review of Economic Studies. 13 (1): 1–9. Bibcode:1945RvES...13....1N. doi:10.2307/2296111. JSTOR 2296111.

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Fukuda, Komei; Terlaky, Tamás (1997). Thomas M. Liebling; Dominique de Werra (eds.). "Criss-cross methods: A fresh view on pivot algorithms". Mathematical Programming, Series B. 79 (1–3): 369–395. CiteSeerX 10.1.1.36.9373. doi:10.1007/BF02614325. MR 1464775. S2CID 2794181. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Murty (1983) Murty, Katta G. (1983). Linear programming. New York: John Wiley & Sons, Inc. pp. xix+482. ISBN 978-0-471-09725-9. MR 0720547. (comprehensive reference to classical approaches).
Roos, C. (1990). "An exponential example for Terlaky's pivoting rule for the criss-cross simplex method". Mathematical Programming. Series A. 46 (1): 79–84. doi:10.1007/BF01585729. MR 1045573. S2CID 33463483.
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.

arxiv.org (Global: 49^th place; English: 31^st place)

Lee, Yin-Tat; Sidford, Aaron (2015). Efficient inverse maintenance and faster algorithms for linear programming. FOCS '15 Foundations of Computer Science. arXiv:1503.01752.
Cohen, Michael B.; Lee, Yin-Tat; Song, Zhao (2018). Solving Linear Programs in the Current Matrix Multiplication Time. 51st Annual ACM Symposium on the Theory of Computing. STOC'19. arXiv:1810.07896.
Lee, Yin-Tat; Song, Zhao; Zhang, Qiuyi (2019). Solving Empirical Risk Minimization in the Current Matrix Multiplication Time. Conference on Learning Theory. COLT'19. arXiv:1905.04447.
Jiang, Shunhua; Song, Zhao; Weinstein, Omri; Zhang, Hengjie (2020). Faster Dynamic Matrix Inverse for Faster LPs. arXiv:2004.07470.

britannica.com (Global: 37^th place; English: 64^th place)

"Linear programming | Definition & Facts | Britannica". www.britannica.com. Retrieved 2023-11-20.

doi.org (Global: 2^nd place; English: 2^nd place)

von Neumann, J. (1945). "A Model of General Economic Equilibrium". The Review of Economic Studies. 13 (1): 1–9. Bibcode:1945RvES...13....1N. doi:10.2307/2296111. JSTOR 2296111.
Kemeny, J. G.; Morgenstern, O.; Thompson, G. L. (1956). "A Generalization of the von Neumann Model of an Expanding Economy". Econometrica. 24 (2): 115–135. doi:10.2307/1905746. JSTOR 1905746.
George B. Dantzig (April 1982). "Reminiscences about the origins of linear programming" (PDF). Operations Research Letters. 1 (2): 43–48. doi:10.1016/0167-6377(82)90043-8. Archived from the original on May 20, 2015.
Narendra Karmarkar (1984). "A New Polynomial-Time Algorithm for Linear Programming". Combinatorica. 4 (4): 373–395. doi:10.1007/BF02579150. S2CID 7257867.
M. Grundmann; V. Kwatra; I. Essa (2011). "Auto-directed video stabilization with robust L1 optimal camera paths". CVPR 2011 (PDF). pp. 225–232. doi:10.1109/CVPR.2011.5995525. ISBN 978-1-4577-0394-2. S2CID 17707171.
Fukuda, Komei; Terlaky, Tamás (1997). Thomas M. Liebling; Dominique de Werra (eds.). "Criss-cross methods: A fresh view on pivot algorithms". Mathematical Programming, Series B. 79 (1–3): 369–395. CiteSeerX 10.1.1.36.9373. doi:10.1007/BF02614325. MR 1464775. S2CID 2794181. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Todd (2002) Todd, Michael J. (February 2002). "The many facets of linear programming". Mathematical Programming. 91 (3): 417–436. doi:10.1007/s101070100261. S2CID 6464735. (Invited survey, from the International Symposium on Mathematical Programming.)
Roos, C. (1990). "An exponential example for Terlaky's pivoting rule for the criss-cross simplex method". Mathematical Programming. Series A. 46 (1): 79–84. doi:10.1007/BF01585729. MR 1045573. S2CID 33463483.
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.
Vaidya, Pravin M. (1989). "Speeding-up linear programming using fast matrix multiplication". 30th Annual Symposium on Foundations of Computer Science. 30th Annual Symposium on Foundations of Computer Science. FOCS. pp. 332–337. doi:10.1109/SFCS.1989.63499. ISBN 0-8186-1982-1.
Illés, Tibor; Terlaky, Tamás (2002). "Pivot versus interior point methods: Pros and cons". European Journal of Operational Research. 140 (2): 170. CiteSeerX 10.1.1.646.3539. doi:10.1016/S0377-2217(02)00061-9. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Anstreicher, Kurt M.; Terlaky, Tamás (1994). "A Monotonic Build-Up Simplex Algorithm for Linear Programming". Operations Research. 42 (3): 556–561. doi:10.1287/opre.42.3.556. ISSN 0030-364X. JSTOR 171894.

dtic.mil (Global: 934^th place; English: 530^th place)

apps.dtic.mil

George B. Dantzig (April 1982). "Reminiscences about the origins of linear programming" (PDF). Operations Research Letters. 1 (2): 43–48. doi:10.1016/0167-6377(82)90043-8. Archived from the original on May 20, 2015.

googleusercontent.com (Global: 144^th place; English: 3,076^th place)

static.googleusercontent.com

M. Grundmann; V. Kwatra; I. Essa (2011). "Auto-directed video stabilization with robust L1 optimal camera paths". CVPR 2011 (PDF). pp. 225–232. doi:10.1109/CVPR.2011.5995525. ISBN 978-1-4577-0394-2. S2CID 17707171.

in-ter-trans.eu (Global: low place; English: low place)

http://www.in-ter-trans.eu/resources/Zesch_Hellingrath_2010_Integrated+Production-Distribution+Planning.pdf Archived 2011-07-20 at the Wayback Machine OptimJ used in an optimization model for mixed-model assembly lines, University of Münster

jstor.org (Global: 23^rd place; English: 15^th place)

von Neumann, J. (1945). "A Model of General Economic Equilibrium". The Review of Economic Studies. 13 (1): 1–9. Bibcode:1945RvES...13....1N. doi:10.2307/2296111. JSTOR 2296111.
Kemeny, J. G.; Morgenstern, O.; Thompson, G. L. (1956). "A Generalization of the von Neumann Model of an Expanding Economy". Econometrica. 24 (2): 115–135. doi:10.2307/1905746. JSTOR 1905746.
Anstreicher, Kurt M.; Terlaky, Tamás (1994). "A Monotonic Build-Up Simplex Algorithm for Linear Programming". Operations Research. 42 (3): 556–561. doi:10.1287/opre.42.3.556. ISSN 0030-364X. JSTOR 171894.

lehigh.edu (Global: low place; English: 7,353^rd place)

coral.ie.lehigh.edu

"COR@L – Computational Optimization Research At Lehigh". lehigh.edu.

mit.edu (Global: 476^th place; English: 340^th place)

web.mit.edu

"lp_solve reference guide (5.5.2.5)". mit.edu. Retrieved 2023-08-10.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Fukuda, Komei; Terlaky, Tamás (1997). Thomas M. Liebling; Dominique de Werra (eds.). "Criss-cross methods: A fresh view on pivot algorithms". Mathematical Programming, Series B. 79 (1–3): 369–395. CiteSeerX 10.1.1.36.9373. doi:10.1007/BF02614325. MR 1464775. S2CID 2794181. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Illés, Tibor; Terlaky, Tamás (2002). "Pivot versus interior point methods: Pros and cons". European Journal of Operational Research. 140 (2): 170. CiteSeerX 10.1.1.646.3539. doi:10.1016/S0377-2217(02)00061-9. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Narendra Karmarkar (1984). "A New Polynomial-Time Algorithm for Linear Programming". Combinatorica. 4 (4): 373–395. doi:10.1007/BF02579150. S2CID 7257867.
M. Grundmann; V. Kwatra; I. Essa (2011). "Auto-directed video stabilization with robust L1 optimal camera paths". CVPR 2011 (PDF). pp. 225–232. doi:10.1109/CVPR.2011.5995525. ISBN 978-1-4577-0394-2. S2CID 17707171.
Fukuda, Komei; Terlaky, Tamás (1997). Thomas M. Liebling; Dominique de Werra (eds.). "Criss-cross methods: A fresh view on pivot algorithms". Mathematical Programming, Series B. 79 (1–3): 369–395. CiteSeerX 10.1.1.36.9373. doi:10.1007/BF02614325. MR 1464775. S2CID 2794181. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Todd (2002) Todd, Michael J. (February 2002). "The many facets of linear programming". Mathematical Programming. 91 (3): 417–436. doi:10.1007/s101070100261. S2CID 6464735. (Invited survey, from the International Symposium on Mathematical Programming.)
Roos, C. (1990). "An exponential example for Terlaky's pivoting rule for the criss-cross simplex method". Mathematical Programming. Series A. 46 (1): 79–84. doi:10.1007/BF01585729. MR 1045573. S2CID 33463483.
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.

sourceforge.net (Global: 1,842^nd place; English: 1,520^th place)

lpsolve.sourceforge.net

"External Language Interfaces". Retrieved 3 December 2021.
"lp_solve command". Retrieved 3 December 2021.

strath.ac.uk (Global: low place; English: 6,381^st place)

strathprints.strath.ac.uk

Illés, Tibor; Terlaky, Tamás (2002). "Pivot versus interior point methods: Pros and cons". European Journal of Operational Research. 140 (2): 170. CiteSeerX 10.1.1.646.3539. doi:10.1016/S0377-2217(02)00061-9. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

web.archive.org (Global: 1^st place; English: 1^st place)

George B. Dantzig (April 1982). "Reminiscences about the origins of linear programming" (PDF). Operations Research Letters. 1 (2): 43–48. doi:10.1016/0167-6377(82)90043-8. Archived from the original on May 20, 2015.
http://www.in-ter-trans.eu/resources/Zesch_Hellingrath_2010_Integrated+Production-Distribution+Planning.pdf Archived 2011-07-20 at the Wayback Machine OptimJ used in an optimization model for mixed-model assembly lines, University of Münster
http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/viewFile/1769/2076 Archived 2011-06-29 at the Wayback Machine OptimJ used in an Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Dantzig, George B.; Thapa, Mukund Narain (1997). Linear programming. New York: Springer. p. xxvii. ISBN 0387948333. OCLC 35318475.
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.
Anstreicher, Kurt M.; Terlaky, Tamás (1994). "A Monotonic Build-Up Simplex Algorithm for Linear Programming". Operations Research. 42 (3): 556–561. doi:10.1287/opre.42.3.556. ISSN 0030-364X. JSTOR 171894.

Linear programming (English Wikipedia)

aaai.org (Global: low place; English: 6,393rd place)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

arxiv.org (Global: 49th place; English: 31st place)

britannica.com (Global: 37th place; English: 64th place)

doi.org (Global: 2nd place; English: 2nd place)

dtic.mil (Global: 934th place; English: 530th place)

apps.dtic.mil

googleusercontent.com (Global: 144th place; English: 3,076th place)

static.googleusercontent.com

in-ter-trans.eu (Global: low place; English: low place)

jstor.org (Global: 23rd place; English: 15th place)

lehigh.edu (Global: low place; English: 7,353rd place)

coral.ie.lehigh.edu

mit.edu (Global: 476th place; English: 340th place)

web.mit.edu

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

sourceforge.net (Global: 1,842nd place; English: 1,520th place)

lpsolve.sourceforge.net

strath.ac.uk (Global: low place; English: 6,381st place)

strathprints.strath.ac.uk

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

aaai.org (Global: low place; English: 6,393^rd place)

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ams.org (Global: 434^th place; English: 249^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

britannica.com (Global: 37^th place; English: 64^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

dtic.mil (Global: 934^th place; English: 530^th place)

googleusercontent.com (Global: 144^th place; English: 3,076^th place)

jstor.org (Global: 23^rd place; English: 15^th place)

lehigh.edu (Global: low place; English: 7,353^rd place)

mit.edu (Global: 476^th place; English: 340^th place)

psu.edu (Global: 299^th place; English: 159^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

sourceforge.net (Global: 1,842^nd place; English: 1,520^th place)

strath.ac.uk (Global: low place; English: 6,381^st place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 4^th place; English: 4^th place)