Linear programming (English Wikipedia)

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

refsWebsite

Global rank English rank

10doi.org

2^nd place

6semanticscholar.org

11^th place

8^th place

4ams.org

451^st place

277^th place

4arxiv.org

69^th place

59^th place

3worldcat.org

5^th place

2web.archive.org

1^st place

2psu.edu

207^th place

136^th place

2sourceforge.net

1,669^th place

1,290^th place

1britannica.com

40^th place

58^th place

1dtic.mil

833^rd place

567^th place

1googleusercontent.com

243^rd place

882^nd place

1strath.ac.uk

low place

7,329^th place

1jstor.org

26^th place

20^th place

1mit.edu

415^th place

327^th place

1lehigh.edu

low place

8,722^nd place

1in-ter-trans.eu

low place

1aaai.org

9,352^nd place

5,696^th place

aaai.org

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

ams.org

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.
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

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

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

doi.org

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.
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.
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

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

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

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

jstor.org

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

coral.ie.lehigh.edu

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

mit.edu

web.mit.edu

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

psu.edu

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.
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.

semanticscholar.org

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.
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

lpsolve.sourceforge.net

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

strath.ac.uk

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.

web.archive.org

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.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

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.