Polyhedral Computations for the Simple Graph Partitioning Problem
AbstractThe simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal. In this paper we present a branch-and-cut algorithm for the problem that uses several classes of facet-defining inequalities as cuttingplanes. These are b-tree, clique, cycle with ear, multistar, and S, Tinequalities. Descriptions of the separation procedures that are used for these inequality classes are also given. In order to evaluate the usefulness of the inequalities and the overall performance of the branch-and-cut algorithm several computational experiments are conducted. We present some of the results of these experiments.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University of Aarhus, Aarhus School of Business, Department of Business Studies in its series CORAL Working Papers with number L-2005-02.
Length: 22 pages
Date of creation: 03 Nov 2005
Date of revision:
Contact details of provider:
Postal: The Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Fax: + 45 86 15 19 43
Web page: http://www.asb.dk/about/departments/bs.aspx
More information through EDIRC
Branch-and-cut algorithm; Facets; Graph partitioning; Multicuts; Separation procedures;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Macambira, Elder Magalhaes & de Souza, Cid Carvalho, 2000. "The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations," European Journal of Operational Research, Elsevier, vol. 123(2), pages 346-371, June.
- Sørensen, Michael M., 2000. "Facet Defining Inequalities for the Simple Graph Partitioning Polytope," Working Papers 00-3, University of Aarhus, Aarhus School of Business, Department of Management Science and Logistics.
- Sorensen, Michael M., 2004. "New facets and a branch-and-cut algorithm for the weighted clique problem," European Journal of Operational Research, Elsevier, vol. 154(1), pages 57-70, April.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Helle Vinbaek Stenholt).
If references are entirely missing, you can add them using this form.