This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Polyhedral Computations for the Simple Graph Partitioning Problem

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Sørensen, Michael M. () (Department of Business Studies)
Abstract

The 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 Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://www.hha.dk/afl/wp/log/L_2005_02.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by University of Aarhus, Aarhus School of Business, Department of Business Studies in its series CORAL Working Papers with number L-2005-02.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 22 pages
Date of creation: 03 Nov 2005
Date of revision:
Handle: RePEc:hhb:aarbls:2005-002

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

For technical questions regarding this item, or to correct its listing, contact: (Helle Vinbaek Stenholt).

Related research
Keywords: Branch-and-cut algorithm; Facets; Graph partitioning; Multicuts; Separation procedures;

References listed on IDEAS
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.:

  1. 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. [Downloadable!] (restricted)
  2. 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.
  3. 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. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? RePEc encourages publishers to make their bibliographic data freely available to the public.

This page was last updated on 2009-12-24.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.