Person:1803741

Available identifiers

zbMath Open sorensen.michael-malmrosWikidataQ59019267 ScholiaQ59019267MaRDI QIDQ1803741

List of research outcomes

Publication	Date of Publication	Type
\texttt{CP-Lib}: benchmark instances of the clique partitioning problem	2024-06-01	Paper
Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes	2018-05-24	Paper
A new separation algorithm for the Boolean quadric and cut polytopes	2015-04-09	Paper
Binary positive semidefinite matrices and associated integer polytopes	2012-02-22	Paper
Binary Positive Semidefinite Matrices and Associated Integer Polytopes	2008-06-10	Paper
Facet-defining inequalities for the simple graph partitioning polytope	2008-01-18	Paper
A Note on Clique-Web Facets for Multicut Polytopes	2005-11-11	Paper
\(b\)-tree facets for the simple graph partitioning polytope	2005-03-15	Paper
New facets and a branch-and-cut algorithm for the weighted clique problem.	2004-02-02	Paper
The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts	1993-06-29	Paper

Research outcomes over time

This page was built for person: Michael Malmros Sørensen