Michael Malmros Sørensen

According to our database, Michael Malmros Sørensen authored at least 10 papers between 1996 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

New facets of the clique partitioning polytope.

Adam N. Letchford, Michael Malmros Sørensen

Oper. Res. Lett., 2025

2024

CP-Lib: Benchmark Instances of the Clique Partitioning Problem.

Michael Malmros Sørensen, Adam N. Letchford

Math. Program. Comput., 2024

2017

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

Michael Malmros Sørensen

Discret. Optim., 2017

2014

A new separation algorithm for the Boolean quadric and cut polytopes.

Adam N. Letchford, Michael Malmros Sørensen

Discret. Optim., 2014

2008

Binary Positive Semidefinite Matrices and Associated Integer Polytopes.

Adam N. Letchford, Michael Malmros Sørensen

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

Facet-defining inequalities for the simple graph partitioning polytope.

Michael Malmros Sørensen

Discret. Optim., 2007

2004

b-Tree Facets for the Simple Graph Partitioning Polytope.

Michael Malmros Sørensen

J. Comb. Optim., 2004

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

Michael Malmros Sørensen

Eur. J. Oper. Res., 2004

2002

A Note on Clique-Web Facets for Multicut Polytopes.

Michael Malmros Sørensen

Math. Oper. Res., 2002

1996

A hyperbolic diffusion model for stock prices.

Bo Martin Bibby, Michael Malmros Sørensen

Finance Stochastics, 1996