Michael Malmros Sørensen

Orcid: 0000-0002-6917-2025

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
New facets of the clique partitioning polytope.
Oper. Res. Lett., 2025

2024
CP-Lib: Benchmark Instances of the Clique Partitioning Problem.
Math. Program. Comput., 2024

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

2014
A new separation algorithm for the Boolean quadric and cut polytopes.
Discret. Optim., 2014

2008
Binary Positive Semidefinite Matrices and Associated Integer Polytopes.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007
Facet-defining inequalities for the simple graph partitioning polytope.
Discret. Optim., 2007

2004
b-Tree Facets for the Simple Graph Partitioning Polytope.
J. Comb. Optim., 2004

New facets and a branch-and-cut algorithm for the weighted clique problem.
Eur. J. Oper. Res., 2004

2002
A Note on Clique-Web Facets for Multicut Polytopes.
Math. Oper. Res., 2002

1996
A hyperbolic diffusion model for stock prices.
Finance Stochastics, 1996


  Loading...