Andrew Vázsonyi (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Andrew Vázsonyi" in English language version.

refsWebsite

Global rank English rank

2^nd place

26^th place

20^th place

451^st place

277^th place

low place

low place

11^th place

8^th place

3,063^rd place

2,041^st place

ams.org

Veida, Nancy C. (2011), "Andrew Vazsonyi", Profiles in Operations Research, International Series in Operations Research & Management Science, vol. 147, Springer, pp. 273–291, doi:10.1007/978-1-4419-6281-2_15, ISBN 978-1-4419-6280-5.
*Erdős, Pál; Grünwald, Tibor; Weiszfeld, Endre (1936), "Végtelen gráfok Euler vonalairól" [On Euler lines of infinite graphs] (PDF), Mat. Fix. Lapok (in Hungarian), 43: 129–140. Translated as Erdős, P.; Grünwald, T.; Vázsonyi, E. (1938), "Über Euler-Linien unendlicher Graphen" [On Eulerian lines in infinite graphs] (PDF), J. Math. Phys. (in German), 17 (1–4): 59–75, doi:10.1002/sapm193817159.
Kuhn, Harold W. (1973), "A note on Fermat's problem", Mathematical Programming, 4 (1): 98–107, doi:10.1007/BF01584648, S2CID 22534094.
Plastria, Frank (2011), "The Weiszfeld algorithm: proof, amendments, and extensions", Foundations of Location Analysis, International Series in Operations Research & Management Science, vol. 155, Springer, pp. 357–389, doi:10.1007/978-1-4419-7572-0_16, ISBN 978-1-4419-7572-0.
Kruskal, J. B. (1960), "Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture" (PDF), Transactions of the American Mathematical Society, 95 (2): 210–225, doi:10.2307/1993287, JSTOR 1993287, MR 0111704.
Keller, L. Robin; Kirkwood, Craig W. (1999), "The founding of ORMS: A decision analysis perspective" (PDF), Operations Research, 47 (1): 16–28, doi:10.1287/opre.47.1.16.

Kruskal, J. B. (1960), "Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture" (PDF), Transactions of the American Mathematical Society, 95 (2): 210–225, doi:10.2307/1993287, JSTOR 1993287, MR 0111704.
Review of Which Door Has the Cadillac:
- Weida, Nancy C. (May–June 2004), Interfaces, 34 (3): 239–240, JSTOR 25062909{{citation}}: CS1 maint: untitled periodical (link)
- Reviews of Scientific Programming in Business and Industry:
  - Flood, Merrill M. (December 1958), American Scientist, 46 (4): 358A, JSTOR 27827234{{citation}}: CS1 maint: untitled periodical (link)
  - Review of Finite Mathematics: Quantitative Analysis for Management:
    - Brambilla, Francesco (September–October 1977), Giornale degli Economisti e Annali di Economia, Nuova Serie, 36 (9/10): 649–650, JSTOR 23244070{{citation}}: CS1 maint: untitled periodical (link)

*Erdős, Pál; Grünwald, Tibor; Weiszfeld, Endre (1936), "Végtelen gráfok Euler vonalairól" [On Euler lines of infinite graphs] (PDF), Mat. Fix. Lapok (in Hungarian), 43: 129–140. Translated as Erdős, P.; Grünwald, T.; Vázsonyi, E. (1938), "Über Euler-Linien unendlicher Graphen" [On Eulerian lines in infinite graphs] (PDF), J. Math. Phys. (in German), 17 (1–4): 59–75, doi:10.1002/sapm193817159.

Kuhn, Harold W. (1973), "A note on Fermat's problem", Mathematical Programming, 4 (1): 98–107, doi:10.1007/BF01584648, S2CID 22534094.

Keller, L. Robin; Kirkwood, Craig W. (1999), "The founding of ORMS: A decision analysis perspective" (PDF), Operations Research, 47 (1): 16–28, doi:10.1287/opre.47.1.16.