Michel Goemans

Michel Goemans is the RSA Professor of Mathematics at the Massachusetts Institute of Technology, effective July 2021. He serves as Department Head of the Mathematics Department and is a Member of the Theory of Computation Group at MIT-CSAIL. His research interests include combinatorial optimization and algorithms, particularly the development of new techniques for designing approximation algorithms. Goemans received both the B.S. & M.S. degrees in applied mathematics from UCLouvain in 1987 and completed his Ph.D. at MIT in 1990. He joined the MIT faculty in 1990 and has held various academic positions, including Professor of Mathematics since 2002. His work has been recognized with numerous awards, including the George B. Dantzig Prize and the Leroy P. Steele Prize for Seminal Contribution to Research.

Michel Goemans is an RSA Professor of Mathematics at MIT, known for his significant contributions to approximation algorithms and combinatorial optimization. His research focuses on developing efficient algorithms for complex optimization problems, particularly in areas such as maximum cut, satisfiability, and network design. Goemans has made notable advancements in semidefinite programming and its applications to combinatorial optimization problems. His work often involves the design and analysis of approximation algorithms that provide near-optimal solutions to NP-hard problems. His research has had a broad impact on theoretical computer science and operations research.