The following pages link to Michael Malmros Sørensen (Q1803741):
Displayed 10 items.
- Item:Q1803741 (redirect page) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes (Q1751235) (← links)
- \(b\)-tree facets for the simple graph partitioning polytope (Q1768607) (← links)
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- A Note on Clique-Web Facets for Multicut Polytopes (Q5704106) (← links)