Michel Goemans
Michel Goemans | |
---|---|
Michel Goemans at the workshop MAPSP, La Roche-en-Ardenne, June 2015. | |
Born | Michel Xavier Goemans |
Thesis | Analysis of Linear Programming Relaxations for a Class of Connectivity Problems (1990) |
Doctoral advisor | Dimitris Bertsimas[1] |
Doctoral students |
Daniel Andrews András Benczúr Jose Correa Brian Dean Nicholas Harvey Jon Kleinberg Aleksander Madry Mohammad Mahdian Vahab Mirrokni V. Ramakrishnan Michael Rosenblum Jan Vondrák David P. Williamson[1] |
Website www-math |
Michel Xavier Goemans (born December, 1964) is a Belgian-American professor of applied mathematics at MIT working in discrete mathematics and combinatorial optimization. Goemans is a fellow of the Association for Computing Machinery (2008),[2] a fellow of the American Mathematical Society (2012),[3] and a fellow of the Society for Industrial and Applied Mathematics (2013).[4] In 2000 he was awarded the MOS-AMS Fulkerson Prize[5] for joint work with David Williamson on the maximum cut problem.
References
- 1 2 Michel Goemans at the Mathematics Genealogy Project
- ↑ Michel Goemans, ACM Fellows, United States 2008, retrieved 2015-10-19
- ↑ List of Fellows of the American Mathematical Society, retrieved 2013-01-19.
- ↑ SIAM Fellows: Class of 2013, retrieved 2015-10-19.
- ↑ Past Winners of the Fulkerson Prize, retrieved 2015-10-19.
|
This article is issued from Wikipedia - version of the Saturday, March 05, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.