The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 1696 of Mathematical Reviews Vol. , Issue 84e
[page]
1984
Mathematical Reviews
Preserved Fulltext
Congratulatory note, followed by a list of Gallai’s publications.
Erdés, P. [Erdés, Paul] 84e:01073 Personal reminiscences and remarks on the mathematical work of Tibor Gallai. ...
His Essay on involution and evolution (1820) was cited by Cauchy on p. 500 of his Cours d’ analyse.
H. S. M. Coxeter (Toronto, Ont.)
Lovasz, Laszlo 84e:01072 Tibor Gallai is seventy years old. ...
A visit to Hungarian mathematics
1993
The Mathematical intelligencer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Peter Ungar shared his reminiscences of Hungarian mathematics. Istvan Vincze spent hours on being interviewed, and let us use his memoirs. ...
Gyorgy Szepe corrected errors of spelling and accents. Barna Szenassy of Debrecen sent helpful information and advice about the history of Hungarian mathematics. ...
The Dialogues on Mathematics [39] is a remarkable work of philosophy and literature. It contains three dialogues-with Socrates, Archimedes, and Galileo. ...
doi:10.1007/bf03024187
fatcat:gtsry72ldzedxpq6nkbkmu5kry
Reflections on Paul Erdős on His Birth Centenary
2015
Notices of the American Mathematical Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
There are eleven articles by leading experts who have reflected on the remarkable life, contributions, and influence of this towering figure of twentieth century mathematics. ...
This is Part I of a two-part feature on Paul Erdős following his centennial. ...
1 László Alpár , Pál Erdős (1913Erdős ( -1996, János Erőds, , Ervin Feldheim , Géza Grünwald (1913Grünwald ( -1944, Tibor Grünwald (Gallai) , Eszter Klein (1910Klein ( -1975, Dezső Lázár , György Szekeres ...
doi:10.1090/noti1211
fatcat:jc6kwszplnb5fn24gu2sf6cwwa
On the History of Combinatorial Optimization (Till 1960)
[chapter]
2005
Handbooks in Operations Research and Management Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
As a consequence, later important developments, like Edmonds' work on matchings and matroids and Cook and Karp's theory of complexity (NP-completeness) fall out of the scope of this survey. ...
Only in the 1950's, when the unifying tool of linear and integer programming became available and the area of operations research got intensive attention, these problems were put into one framework, and ...
I thank Sasha Karzanov for his efficient help in finding Tolstoȋ's and several other papers in the (former) Lenin Library in Moscow, Irina V. Karzanova for accurately providing ...
doi:10.1016/s0927-0507(05)12001-5
fatcat:5gmzg2m7lzcptgknkcx6ubhmqi
Page 233 of Mathematical Reviews Vol. 16, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Schwarz (Zbl 492:10037)) 84m:10038b 10H25 (10H15)
Personal reminiscences and remarks on the mathematical work of Tibor Gallai Combinatorica 2 (1982), no. 3, 207-212. (Title) 84e:01073 01A70 (05-03) ...
Remarks on the differences between consecutive primes. Elem Math. 35 (1980), no. 5, 115-118. (Samuel S. ...
14th International Symposium on Mathematical Programming
1990
Mathematical programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral ...
Finally I report numerical results of a comparison between the variant and a minimization approach using penalty functions. ...
particular subclass, and develop convergent iterative techniques reminiscent of the greedy algorithm for its on-line computation. ...
doi:10.1007/bf01580875
fatcat:3jtclwmntzgjxkqs5uecombdaa