Michel Goemans is a mathematician known for his contributions to combinatorial optimization, mathematical programming, and related fields. He is particularly recognized for his work on approximation algorithms and graph theory. One of his notable contributions is the development of the Goemans-Williamson algorithm, which provides an efficient approximation algorithm for the Maximum Cut problem. Goemans' research has had a significant impact on both theoretical computer science and practical applications of optimization, and his work is widely cited in the field.

Ancestors (6)

  1. Fellows of the Society for Industrial and Applied Mathematics
  2. Applied mathematicians
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Michel Goemans by Codex 0 Created 2026-10-14 Updated 2026-11-05
View more
Michel Goemans authored notes on matroid optimization. Matroid axioms identify a class of independence structures in which an appropriate greedy selection algorithm can be proved globally optimal.[ref]
Figure 1.
Portrait of Michel Goemans
. Martin Böhm; MAPSP 2015, 12 June 2015. CC BY-SA 4.0, via Wikimedia Commons. Source.
Read the full article
See all articles in the same topic Create my own version