Michel Goemans

Mitchell Goemans is the RSA Professor of Mathematics at the Massachusetts Institute of Technology (MIT), where he also serves as the Head of the Department of Mathematics. He is a member of the Theory of Computation group at MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on combinatorial optimization, approximation algorithms, and algorithmic mathematics. He is an ACM Fellow, recognizing his contributions to theoretical computer science and discrete mathematics.

Goemans has taught numerous advanced courses at MIT, including Advanced Combinatorial Optimization, Algorithms, and Topics in Theoretical Computer Science. His work bridges foundational mathematics with computational challenges, emphasizing techniques like semidefinite programming and matroid theory.

Key research areas include non-bipartite matchings, matroid intersection, submodular function optimization, and approximation algorithms for NP-hard problems. His contributions to the Traveling Salesman Problem and semidefinite programming relaxations are particularly influential.

Awards and recognitions include the ACM Fellowship (2009) and leadership roles in academic administration, reflecting his dual impact on research and education.