Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Formulations and valid inequalities for the node capacitated graph partitioning problem
Author: Ferreira, CE
Martin, A
deSouza, CC
Weismantel, R
Wolsey, LA
Abstract: We investigate the problem of partitioning the nodes of a graph under capacity restriction on the sum of the node weights in each subset of the partition. The objective is to minimize the sum of the costs of the edges between the subsets of the partition. This problem has a variety of applications, for instance in the design of electronic circuits and devices. We present alternative integer programming formulations for this problem and discuss the links between these formulations. Having chosen to work in the space of edges of the multicut, we investigate the convex hull of incidence vectors of feasible multicuts. In particular, several classes of inequalities are introduced, and their strength and robustness are analyzed as various problem parameters change.
Subject: clustering
graph partitioning
integer programming
ear decomposition
Country: EUA
Editor: Springer
Citation: Mathematical Programming. Springer, v. 74, n. 3, n. 247, n. 266, 1996.
Rights: fechado
Identifier DOI: 10.1007/BF02592198
Date Issue: 1996
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOSA1996VH12500003.pdf909.83 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.