Facet Defining Inequalities for the Simple Graph Partitioning Polytope.
Year of publication: |
2000-01-01
|
---|---|
Authors: | Sørensen, Michael M. |
Institutions: | Institut for Marketing og Organisation, Aarhus Universitet |
Subject: | Clique partitioning | Clustering | Graph partitioning | Multicuts | Polyhedral combinatorics |
-
b-Tree Facets for the Simple Graph Partitioning Polytope.
Sørensen, Michael M., (2000)
-
Polyhedral Computations for the Simple Graph Partitioning Problem
Sørensen, Michael M., (2005)
-
Lagrangian relaxation and pegging test for the clique partitioning problem
Sukegawa, Noriyoshi, (2013)
- More ...
-
New Facets and a Branch-and-Cut Algorithm for the Weighted Clique Problem.
Sørensen, Michael M., (2001)
-
b-Tree Facets for the Simple Graph Partitioning Polytope.
Sørensen, Michael M., (2000)
-
A Note on Clique-Web Facets for Multicut Polytopes
Sørensen, Michael M., (2002)
- More ...