Department of Economics and Business Economics

Michael Malmros Sørensen

  1. 2017
  2. Published

    Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes. / Sørensen, Michael Malmros.

    In: Discrete Optimization, Vol. 25, 27.07.2017, p. 120-140.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  3. 2014
  4. Published

    A new separation algorithm for the Boolean quadric and cut polytopes. / Sørensen, Michael Malmros; Letchford, Adam N.

    In: Discrete Optimization, Vol. 14, 2014, p. 61-71.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  5. 2012
  6. Published

    Binary Positive Semidefinite Matrices and Associated Integer Polytopes. / Letchford, Adam N.; Sørensen, Michael Malmros.

    In: Mathematical Programming, Vol. 131, No. 1-2, 2012, p. 253-271.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  7. 2008
  8. Published

    Binary positive semidefinite matrices and associated integer polytopes. / Sørensen, Michael Malmros; Letchford, Adam N.

    In: Lecture Notes in Computer Science, 2008, p. 125-139.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  9. 2007
  10. Published

    Facet-defining inequalities for the simple graph partitioning polytope. / Sørensen, Michael Malmros.

    In: Discrete Optimization, Vol. 4, No. 2, 2007, p. 221-231.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  11. 2005
  12. Published

    Polyhedral Computations for the Simple Graph Partitioning Problem. / Sørensen, Michael Malmros.

    Aarhus School of Business, Department of Accounting, Finance and Logistics, 2005.

    Research output: Working paperResearch

  13. 2004
  14. Published

    New facets and a branch-and-cut algorithm for the weighted clique problem. / Sørensen, Michael Malmros.

    In: European Journal of Operational Research, Vol. 154, No. 1, 2004, p. 57-70.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  15. Published

    b-tree facets for the simple graph partitioning polytope. / Sørensen, Michael Malmros.

    In: Journal of Combinatorial Optimization, Vol. 8, No. 2, 2004, p. 151-170.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  16. 2002
  17. Published

    A Note on Clique-Web Facets for Multicut Polytopes. / Sørensen, Michael Malmros.

    2002.

    Research output: Working paperResearch

  18. Published

    A note on clique-web facets for multicut polytopes. / Sørensen, Michael Malmros.

    In: Mathematics of Operations Research, Vol. 27, No. 4, 2002, p. 740-742.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  19. 2001
  20. Published
  21. 2000
  22. Published
  23. Published
  24. 1999
  25. Published
  26. 1993
  27. Published

    The optimal graph partitioning problem : Solution method based on reducing symmetric nature and combinatorial cuts. / Sørensen, Michael Malmros; Holm, Søren.

    In: OR Spektrum, Vol. 15, No. 1, 1993, p. 1-8.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review