Authors 
: 

Document type 
: 
Article de périodique (Journal article) – Article de recherche

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. 
Publication date 
: 
1996 
Language 
: 
Anglais 
Journal information 
: 
"Mathematical Programming"  Vol. 74, no. 3, p. 247266 (1996) 
Peer reviewed 
: 
yes 
Publisher 
: 
Elsevier Science Bv (Amsterdam)

issn 
: 
00255610 
eissn 
: 
14364646 
Publication status 
: 
Publié 
Affiliation 
: 
UCL
 FSA/INMA  Département d'ingénierie mathématique

Keywords 
: 
clustering ; graph partitioning ; equipartition ; knapsack ; integer programming ; ear decomposition

Links 
: 
