Jump to content

Michel Goemans

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 68.58.97.3 (talk) at 21:56, 5 March 2016 (Linked to Dimitris Bertsimas' page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Michel Goemans
Michel Goemans at the workshop MAPSP, La Roche-en-Ardenne, June 2015.
Born
Michel Xavier Goemans
Scientific career
Thesis Analysis of Linear Programming Relaxations for a Class of Connectivity Problems  (1990)
Doctoral advisorDimitris Bertsimas[1]
Doctoral studentsDaniel 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]
Websitewww-math.mit.edu/~goemans

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

Template:Persondata