Andrew Vázsonyi

Andrew Vázsonyi (1916–2003), also known as Endre Weiszfeld and Zepartzatt Gozinto) was a Hungarian mathematician and operations researcher. He is known for Weiszfeld's algorithm for minimizing the sum of distances to a set of points, and for founding The Institute of Management Sciences.[1][2][3]


Endre Weiszfeld was born on November 4, 1916, the middle son of a Jewish family in Budapest, where his father was the owner of a shoe store. At age 14, he met and befriended Paul Erdős (his elder by three years), and at age 16, he began working on the geometric median problem for which he would later publish a solution. He studied at the Pázmány Péter Catholic University in Budapest, from which he earned a doctorate in 1936. His thesis, on higher-dimensional surfaces, was supervised by Lipót Fejér. Because of increasing discrimination against Jews in the 1930s and following the lead of his cousin, politician Vilmos Vázsonyi, he changed his name in 1937 to Andrew Vázsonyi. The name comes from that of his father's native town, Nagyvázsony.[1][3][4] During this period, Vázsonyi studied graph theory, working with Erdős on finding necessary and sufficient conditions for an infinite graph to have an Euler tour.[5][6]

In 1938, Vázsonyi was invited by Otto Szász to escape Europe and work with Szász at the University of Cincinnati, but was only able to obtain a one-year student visa. Instead, he traveled to Paris, and finally succeeded in traveling to the US in April 1940, two months before France's fall to the Nazis. He spent a year at a Quaker workshop at Haverford, Pennsylvania, and in 1941 began graduate studies in mechanical engineering at Harvard University, studying there under Richard von Mises with the support of a Gordon McKay Fellowship. He earned an M.S. in 1942 and continued to work at Harvard for Howard Wilson Emmons, studying the design of supersonic aircraft. While at Harvard, he met and married Baroness Laura Vladimirovna Saparova, a musician and immigrant from Georgia whom he had met at Harvard's International Club.[1][3][7]

In 1945, Vázsonyi took US citizenship and left Harvard, working as an engineer for the Elliott Company in Jeannette, Pennsylvania. From there, he moved to southern California, where he worked on missile design for North American Aviation. He moved to the U.S. Naval Ordnance Test Station in 1948, where he headed their missile guidance and control division, and in 1953 moved again to Hughes Aircraft. At Hughes, his interests shifted from aeronautics to management science. He began working on computerization of Hughes' payroll and production lines, and on diagramming parts requirements. His alias "Zepartzatt Gozinto" began during this period, when he visited the RAND Corporation and, during a presentation there, made a joke that was misinterpreted by attendee George Dantzig. Through the 1950s and 1960s, Vázsonyi continued to work on management science problems at several other companies, including the Ramo-Wooldridge Corporation, Roe Alderson, and a second stint at NAA.[1][3][8]

In 1970, Vázsonyi joined the School of Management at the University of Southern California,[9] but he did not get tenure there, and in 1973 he moved to the Graduate School of Business at the University of Rochester. In the late 1970s, threatened with forced retirement at Rochester as he neared age 65,[10] he moved again to St. Mary's University, Texas. He retired in 1987, but continued to teach as an emeritus professor at the University of San Francisco.[1]

Vázsonyi died on November 13, 2003 in Santa Rosa, California.[1] In 2009, a memorial collection of research articles was published in his honor.[11]


Weiszfeld's algorithmEdit

The geometric median of a set of points in the Euclidean plane is the point (not necessarily in the given set) that minimizes the sum of distances to the given points; the solution for three points was first given by Evangelista Torricelli, after being challenged with it by Pierre de Fermat in the 17th century. An algorithm for the more general problem with an arbitrarily large number of points, published by Weiszfeld in 1937,[12] solves this problem numerically using a hill climbing procedure that repeatedly finds a point improving the sum of distances until no more improvements can be made. Each step of this algorithm assigns weights to the points, inversely proportional to the distances to the current solution, and then finds the weighted average of the points, which is the point that minimizes the sum of the squares of the weighted distances. The algorithm has been frequently rediscovered, and although other methods for finding the geometric median are known, Weiszfeld's algorithm is still frequently used due to its simplicity and rapid convergence.[13][14]

Kruskal's tree theoremEdit

Kruskal's tree theorem states that, in every infinite set of finite trees, there exists a pair of trees one of which is homeomorphically embedded into the other; another way of stating the same fact is that the homeomorphisms of trees form a well-quasi-ordering. In his 1960 paper giving the first proof of this result, Joseph Kruskal credits it to a conjecture of Vázsonyi.[15] The Robertson–Seymour theorem greatly generalizes this result from trees to graphs.

TIMS and DSIEdit

While working in the aerospace industry, Vázsonyi attended meetings of the Operations Research Society of America, but found it to be too remote from the business interests of his employers. In 1953, with William W. Cooper and Mel Salveson, Vázsonyi founded The Institute of Management Sciences; Cooper became the first president of the new society, and Vázsonyi became the first past president (without ever having been president).[1] ORSA and TIMS later merged in 1995 to form the Institute for Operations Research and the Management Sciences.[16]

Vázsonyi also helped found the Decision Sciences Institute, and became a fellow of it.[1]


As well as his 2002 autobiography, Which Door Has the Cadillac: Adventures of a Real-Life Mathematician,[17] Vázsonyi was the author of several technical books, including:

  • Scientific programming in business and industry (Wiley, 1963)[18]
  • Problem solving by digital computers with PL/I programming (Prentice-Hall, 1970)
  • Finite mathematics: quantitative analysis for management (Wiley, 1977)[19]
  • Introduction to data processing (R. D. Irwin, 1980)


  1. ^ a b c d e f g h Gass, Saul I. (February 2004), "In Memoriam Andrew (Andy) Vazsonyi: 1916-2003. Operations research/management science pioneer, educator, researcher, illustrator and author helped shape profession", OR/MS Today.
  2. ^ Vázsonyi, Andrew (2002), Which Door Has the Cadillac: Adventures of a Real-Life Mathematician, Writer's Club Press and iUniverse.
  3. ^ a b c d Veida, Nancy C. (2011), "Andrew Vazsonyi", Profiles in Operations Research, International Series in Operations Research & Management Science, 147, Springer, pp. 273–291, doi:10.1007/978-1-4419-6281-2_15.
  4. ^ Schechter, Bruce (2000), My Brain is Open: The Mathematical Journeys of Paul Erdös, Simon and Schuster, pp. 19–21, ISBN 9780684859804.
  5. ^ Schechter (2000), pp. 73–74.
  6. ^ *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.
  7. ^ Vázsonyi (2002), p. 102.
  8. ^ Vázsonyi (2002), p. 206.
  9. ^ Vázsonyi (2002), p. 262. Instead, Gass writes that he joined the University of California.
  10. ^ Vázsonyi (2002), p. 274.
  11. ^ Drezner, Zvi; Plastria, Frank, eds. (2009), Location Analysis in Honor of Andrew Vazsonyi (also known as E. Weiszfeld), Annals of Operations Research, 167, Springer.
  12. ^ Weiszfeld, E. (1937), "Sur le point pour lequel la somme des distances de n points donnes est minimum", Tohoku Mathematical Journal (in French), 43: 355–386. Translated into English and annoted by Plastria, F. (2009), "On the point for which the sum of the distances to n given points is minimum", in Drezner & Plastria (2009), pp. 7–41.
  13. ^ Kuhn, Harold W. (1973), "A note on Fermat's problem", Mathematical Programming, 4 (1): 98–107, doi:10.1007/BF01584648, S2CID 22534094.
  14. ^ Plastria, Frank (2011), "The Weiszfeld algorithm: proof, amendments, and extensions", Foundations of Location Analysis, International Series in Operations Research & Management Science, 155, Springer, pp. 357–389, doi:10.1007/978-1-4419-7572-0_16, ISBN 978-1-4419-7572-0 CS1 maint: discouraged parameter (link).
  15. ^ 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 CS1 maint: discouraged parameter (link).
  16. ^ 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.
  17. ^ Review of Which Door Has the Cadillac:
    • Weida, Nancy C. (May–June 2004), Interfaces, 34 (3): 239–240, JSTOR 25062909CS1 maint: untitled periodical (link)
  18. ^ Reviews of Scientific Programming in Business and Industry:
    • Flood, Merrill M. (December 1958), American Scientist, 46 (4): 358A, JSTOR 27827234CS1 maint: untitled periodical (link)
    • Graves, Robert L. (December 1958), Journal of the American Statistical Association, 53 (284): 1043–1044, doi:10.2307/2281982, JSTOR 2281982CS1 maint: untitled periodical (link)
    • E. K. (March 1959), OR, 10 (1): 72–73, doi:10.2307/3007313, JSTOR 3007313CS1 maint: untitled periodical (link)
    • Dresch, Francis W. (March–April 1959), Operations Research, 7 (2): 261–262, JSTOR 167164CS1 maint: untitled periodical (link)
    • Spivey, W. Allen (April 1959), Southern Economic Journal, 25 (4): 485–486, doi:10.2307/1055425, JSTOR 1055425CS1 maint: untitled periodical (link)
    • Schlosser, Robert E. (April 1959), The Accounting Review, 34 (2): 342–343, JSTOR 241993CS1 maint: untitled periodical (link)
    • Vajda, S. (1959), Biometrika, 46 (1/2 (Jun., 1959): 274, doi:10.2307/2332852, JSTOR 2332852CS1 maint: untitled periodical (link)
    • Vidale, M. L. (July 1959), Journal of Marketing, 24 (1): 108, doi:10.2307/1249381, JSTOR 1249381CS1 maint: untitled periodical (link)
    • Hammer, Preston C. (October 1959), The American Mathematical Monthly, 66 (8): 738, doi:10.2307/2309379, JSTOR 2309379CS1 maint: untitled periodical (link)
    • Wetzel, Wolfgang (1960), Weltwirtschaftliches Archiv, 84: 45–46, JSTOR 40306630CS1 maint: untitled periodical (link)
    • Starr, Martin K. (July 1960), Management Science, 6 (4): 500–501, JSTOR 2627090CS1 maint: untitled periodical (link)
    • Künzi, Hans (October 1961), Econometrica, 29 (4): 820–821, doi:10.2307/1911827, JSTOR 1911827CS1 maint: untitled periodical (link)
  19. ^ 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 23244070CS1 maint: untitled periodical (link)

External ResourcesEdit