Michel Goemans

from Wikipedia, the free encyclopedia

Michel Xavier Goemans (* December 1964 ) is a Belgian-American mathematician who deals with combinatorial optimization and discrete mathematics. He is the Leighton Family Professor of Applied Mathematics at the Massachusetts Institute of Technology (MIT), where he is at the CSAIL and MIT Operations Research Center.

Michel Goemans, Oberwolfach 2011

Goemans received his PhD in 1990 from MIT with Dimitris Bertsimas (Analysis of Linear Programming Relaxations for a Class of Connectivity Problems). He is a professor at MIT and an adjunct professor at the University of Waterloo . He was also a professor at Leuven University and visiting professor at RIMS at Kyoto University.

He is known for an approximation algorithm based on semidefiniter programming for the Max-Cut-Problem with David P. Williamson , an NP-hard problem: one divides the vertex set of a graph in such a way that a maximum set of edges intersects the interface.

In 2012 he received the Farkas Prize, in 2000 with David P. Williamson the Fulkerson Prize (Maxcut Algorithm) and twice the SIAM Optimization Prize (1996, 1999). He is a Fellow of the American Mathematical Society (2013), the Association for Computing Machinery (2008) and the SIAM (2013). From 1995 to 1997 he was a Sloan Research Fellow and he was a Guggenheim Fellow . In 1998 he was invited speaker at the International Congress of Mathematicians in Berlin (Semidefinite Programming and Combinatorial Optimization). In 1991 he received the AW Tucker Prize.

His hobby is sailing. Goemans is a Belgian and US citizen.

Fonts

  • with David P. Williamson: The Primal-Dual Method for Approximation Algorithms and its Application to Network Design Problems, in D. Hochbaum, Approximation Algorithms, 1997
  • with David P. Williamson: A general approximation technique for constrained forest problems, SIAM J. Computing, Volume 24, 1995, pp. 296-317
  • with David P. Williamson: The primal-dual method for approximation algorithms and its application to network design problems, in: Approximation algorithms for NP-hard problems, 1997, pp. 144–191
  • with Andrew V. Goldberg, Serge Plotkin, David B. Shmoys, Éva Tardos , David P. Williamson: Improved approximation algorithms for network design problems, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms 1994, pp. 223-232
  • Semidefinite Programming in Combinatorial Optimization, Mathematical Programming, Volume 79, 1997, pp. 143--161

Web links

Individual evidence

  1. ↑ Michel Goemans in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ↑ for Improved approximation algorithms for the maximum cut and satisfiability problems using semi-definite programming , Journal of the ACM, Vol. 42, 1995, pp. 1115-1145
  3. ^ Tucker Prize
personal data
SURNAME Goemans, Michel
ALTERNATIVE NAMES Goemans, Michel Xavier
BRIEF DESCRIPTION Belgian-American mathematician
DATE OF BIRTH December 1964