العربية
中国
Français
Deutsch
Ελληνική
हिन्दी
Italiano
日本語
Português
Русский
EspañolJACK EDMONDS
'Jack R. Edmonds' is a Canadian mathematician, regarded as one of the most important contributors to the field of combinatorial optimization. He was the recipient of the 1985 John von Neumann Theory Prize.
From 1969 on, with the exception of 1991-1993, he held a faculty position at the Department of Combinatorics and Optimization at the University of Waterloo's Faculty of Mathematics. Edmonds retired in 1999.
From 1991 to 1993, he was involved in a dispute ("the Edmonds affair") with the University of Waterloo. The university claimed he had resigned, but he denied it. The conflict was resolved in 1993, and he returned to the university.
The Fifth Aussois Workshop on Combinatorial Optimization in 2001 was dedicated to Jack Edmonds.
Edmond's matching algorithm and the research paper which describes this algorithm is one of the most cited papers.
He introduced polymatroids, blockers and cutters.
★ Edmonds-Karp algorithm
★ Paths, Trees, and Flowers
★
From 1969 on, with the exception of 1991-1993, he held a faculty position at the Department of Combinatorics and Optimization at the University of Waterloo's Faculty of Mathematics. Edmonds retired in 1999.
From 1991 to 1993, he was involved in a dispute ("the Edmonds affair") with the University of Waterloo. The university claimed he had resigned, but he denied it. The conflict was resolved in 1993, and he returned to the university.
The Fifth Aussois Workshop on Combinatorial Optimization in 2001 was dedicated to Jack Edmonds.
Edmond's matching algorithm and the research paper which describes this algorithm is one of the most cited papers.
He introduced polymatroids, blockers and cutters.
| Contents |
| See also |
| External links |
See also
★ Edmonds-Karp algorithm
External links
★ Paths, Trees, and Flowers
★
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves
