Michael Malmros Sørensen

lic.merc., Lektor

Profile photo

Michael Malmros Sørensen


  • Institut for Økonomi
Fuglesangs Allé 4
2621, 117
Aarhus V

E-mail: mim@econ.au.dk

Telefon: +4587164907


Michael Malmros Sørensen received his PhD at Aarhus School of Business (ASB) in 1996, and he has an MSc in Business Administration from ASB from 1992. His main work interests focus on problems within the areas of optimization, logistics, and computer simulation. He is currently a member of the research group Cluster for Operations Research and Logistics (CORAL).

Teaching Interests:
Decision analysis
Operations Management
Optimization methods and modeling
Simulation modeling and analysis

Research Interests:
Integer and combinatorial optimization
Optimization theory and algorithms
Current reserach projects include
1) Separation routines for graph partitioning polytopes
2) A branch-and-cut algorithm for the simple graph partitioning problem


Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes

Sørensen, M. M., 27 jul. 2017, I : Discrete Optimization. 25, s. 120-140 21 s.

A new separation algorithm for the Boolean quadric and cut polytopes

Sørensen, M. M. & Letchford, A. N., 2014, I : Discrete Optimization. 14, s. 61-71 11 s.

Binary Positive Semidefinite Matrices and Associated Integer Polytopes

Letchford, A. N. & Sørensen, M. M., 2012, I : Mathematical Programming. 131, 1-2, s. 253-271 19 s.

Facet-defining inequalities for the simple graph partitioning polytope

Sørensen, M. M., 2007, I : Discrete Optimization. 4, 2, s. 221-231 11 s.

New facets and a branch-and-cut algorithm for the weighted clique problem

Sørensen, M. M., 2004, I : European Journal of Operational Research. 154, 1, s. 57-70 14 s.

b-tree facets for the simple graph partitioning polytope

Sørensen, M. M., 2004, I : Journal of Combinatorial Optimization. 8, 2, s. 151-170 20 s.

A note on clique-web facets for multicut polytopes

Sørensen, M. M., 2002, I : Mathematics of Operations Research. 27, 4, s. 740-742 3 s.

The optimal graph partitioning problem: Solution method based on reducing symmetric nature and combinatorial cuts

Sørensen, M. M. & Holm, S., 1993, I : OR Spektrum. 15, 1, s. 1-8 8 s.