Michael Malmros Sørensen

MaRDI QIDQ1803741zbMATH OpenORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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

Research outcomes over time

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