Michel Goemans

Michel Goemans at Oberwolfach in 2011 Michel Xavier Goemans (born December 1964) is a Belgian-American professor of applied mathematics and the RSA Professor of Mathematics at Massachusetts Institute of Technology working in discrete mathematics and combinatorial optimization at CSAIL and MIT Operations Research Center. Provided by Wikipedia
Showing 1 - 20 results of 27 for search 'Goemans, Michel', query time: 0.04s Refine Results
  1. 1
    6.854J / 18.415J Advanced Algorithms, Fall 2001

    6.854J / 18.415J Advanced Algorithms, Fall 2001 by Goemans, Michel

    Published 2001
    Get full text
    Learning Object
  2. 2
    Report to the President for year ended June 30, 2021, Department of Mathematics

    Report to the President for year ended June 30, 2021, Department of Mathematics by Goemans, Michel X.

    Published 2025
    Get full text
  3. 3
    Analysis of Linear Programming Relaxations for a Class of Connectivity Problems

    Analysis of Linear Programming Relaxations for a Class of Connectivity Problems by Goemans, Michel X.

    Published 2004
    Get full text
    Working Paper
  4. 4
    Smallest Compact Formulation for the Permutahedron

    Smallest Compact Formulation for the Permutahedron by Goemans, Michel X.

    Published 2014
    Get full text
    Get full text
    Article
  5. 5
    Polynomiality for Bin Packing with a Constant Number of Item Types

    Polynomiality for Bin Packing with a Constant Number of Item Types by Goemans, Michel X, Rothvoss, Thomas

    Published 2021
    Get full text
    Article
  6. 6
    Polynomiality for Bin Packing with a Constant Number of Item Types

    Polynomiality for Bin Packing with a Constant Number of Item Types by Goemans, Michel X., Rothvoss, Thomas

    Published 2022
    Get full text
    Article
  7. 7
    Analysis of linear programming relaxations for a class of connectivity problems

    Analysis of linear programming relaxations for a class of connectivity problems by Goemans, Michel X. (Michel Xavier)

    Published 2005
    Get full text
    Thesis
  8. 8
    Probabilistic analysis of the 1-tree relaxation for the Eculidean traveling salesman problem

    Probabilistic analysis of the 1-tree relaxation for the Eculidean traveling salesman problem by Goemans, Michel X., Bertsimas, Dimitris

    Published 2009
    Get full text
    Working Paper
  9. 9
    Polynomiality for Bin Packing with a Constant Number of Item Types

    Polynomiality for Bin Packing with a Constant Number of Item Types by Goemans, Michel X., Rothvoss, Thomas

    Published 2015
    Get full text
    Get full text
    Article
  10. 10
    Approximating incremental combinatorial optimization problems

    Approximating incremental combinatorial optimization problems by Goemans, Michel X, Unda, Francisco Tomas

    Published 2018
    Get full text
    Get full text
    Get full text
    Article
  11. 11
    Survivable Network, Linear Programming Relaxations and the Parsimonious Property

    Survivable Network, Linear Programming Relaxations and the Parsimonious Property by Goemans, Michel X., Bertsimas, Dimitris J.

    Published 2004
    Get full text
    Working Paper
  12. 12
    Survivable Networks, Linear Programming Relaxations and the Parsimonious Property

    Survivable Networks, Linear Programming Relaxations and the Parsimonious Property by Goemans, Michel X., Bertsimas, Dimitris J.

    Published 2004
    Get full text
    Working Paper
  13. 13
    A Catalog of Steinger Tress Formulations

    A Catalog of Steinger Tress Formulations by Goemans, Michel X., Myung, Young-soo

    Published 2004
    Get full text
    Working Paper
  14. 14
    Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations

    Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations by Goemans, Michel X., Soto, Jose A.

    Published 2013
    Get full text
    Get full text
    Article
  15. 15
    Discrete Newton’s Algorithm for Parametric Submodular Function Minimization

    Discrete Newton’s Algorithm for Parametric Submodular Function Minimization by Goemans, Michel X, Gupta, Swati, Jaillet, Patrick

    Published 2018
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16
    An Algorithmic Framework for Wireless Information Flow

    An Algorithmic Framework for Wireless Information Flow by Goemans, Michel X., Iwata, Satoru, Zenklusen, Rico

    Published 2011
    Get full text
    Get full text
    Article
  17. 17
    Deterministic network information flows using polylinking systems

    Deterministic network information flows using polylinking systems by Goemans, Michel X., Iwata, Satoru, Zenklusen, Rico

    Published 2013
    Get full text
    Get full text
    Article
  18. 18
    Community detection in hypergraphs, spiked tensor models, and Sum-of-Squares

    Community detection in hypergraphs, spiked tensor models, and Sum-of-Squares by Kim, Chiheon, Sousa Bandeira, Afonso Jose, Goemans, Michel X

    Published 2018
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19
    Tight Approximation Algorithms for Maximum Separable Assignment Problems

    Tight Approximation Algorithms for Maximum Separable Assignment Problems by Goemans, Michel X., Fleischer, Lisa, Mirrokni, Vahab, Sviridenko, Maxim

    Published 2013
    Get full text
    Get full text
    Article
  20. 20
    Matroids and integrality gaps for hypergraphic steiner tree relaxations

    Matroids and integrality gaps for hypergraphic steiner tree relaxations by Goemans, Michel X., Olver, Neil, Rothvoss, Thomas, Zenklusen, Rico

    Published 2013
    Get full text
    Get full text
    Article

Search Tools: