Facet-defining inequalities for the simple graph partitioning polytope

Authors:
Michael M. SøRensen
Affiliations:
Aarhus School of Business, Department of Business Studies, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Venue:
Discrete Optimization
Year:
2007

Citing 18
Cited 0

On the cut polytope

Mathematical Programming: Series A and B
A cutting plane algorithm for a clustering problem

Mathematical Programming: Series A and B
Facets of the clique partitioning polytope

Mathematical Programming: Series A and B
The equipartition polytope. I: formulations, dimension and basic facets

Mathematical Programming: Series A and B
The equipartition polytope. II: valid inequalities and facets

Mathematical Programming: Series A and B
Clique-web facets for multicut polytopes

Mathematics of Operations Research
The partition problem

Mathematical Programming: Series A and B
Facets for the cut cone I

Mathematical Programming: Series A and B
Facets for the cut cone II: clique-web inequalities

Mathematical Programming: Series A and B
Facets of the k-partition polytope

Discrete Applied Mathematics
Some new classes of facets for the equicut polytope

Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
Formulations and valid inequalities for the node capacitated graph partitioning problem

Mathematical Programming: Series A and B
A branch-and-cut algorithm for the equicut problem

Mathematical Programming: Series A and B
The node capacitated graph partitioning problem: a computational study

Mathematical Programming: Series A and B - Special issue on computational integer programming
A Note on Clique-Web Facets for Multicut Polytopes

Mathematics of Operations Research
Efficient algorithm for the partitioning of trees

IBM Journal of Research and Development
Geometry of Cuts and Metrics

Geometry of Cuts and Metrics
Lifting theorems and facet characterization for a class of clique partitioning inequalities

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The simple graph partitioning problem is to partition an edge-weighted graph into mutually node-disjoint subgraphs, each containing at most b nodes, such that the sum of the weights of all edges in the subgraphs is maximal. In this paper we provide several classes of facet-defining inequalities for the associated simple graph partitioning polytope.