The node capacitated graph partitioning problem: A computational study

@article{Ferreira1998TheNC,
  title={The node capacitated graph partitioning problem: A computational study},
  author={Carlos Eduardo Ferreira and Alexander Martin and Cid C. de Souza and Robert Weismantel and Laurence A. Wolsey},
  journal={Math. Program.},
  year={1998},
  volume={81},
  pages={229-256}
}
In this paper we consider the problem of k-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing the sum of the costs of the edges between the subsets of the partition. Based on a study of valid inequalities, we present a variety of separation heuristics for cycle, cycle with ears, knapsack tree and path-block-cycle inequalities among others. The separation heuristics, plus primal heuristics… CONTINUE READING
BETA
Highly Cited
This paper has 141 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
SHOWING 1-10 OF 61 CITATIONS, ESTIMATED 43% COVERAGE

142 Citations

01020'98'03'09'15
Citations per Year
Semantic Scholar estimates that this publication has 142 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

A New Approach to Minimising the Frontwidth in Finite Element Calculations

  • C. C. de Souza, R. Keunings, L. A. Wolsey
  • Zone
  • 1994
2 Excerpts

Optimisation des Fonctions Quadratiques en Variables Bivalentes, Thèse de Doctorat

  • N. Boissin
  • Conservatoire National des Arts et Métiers,
  • 1994
1 Excerpt

The Node Capacitated Graph Partitioning Problems: Formulations and Valid Inequalities, Working Paper, IASI

  • C. Brunetta, G. Rinaldi, A. Sassano
  • 1994
2 Excerpts

The Graph Equipartition Problem: Optimal Solutions, Extensions and Applications

  • C. C. de Souza
  • Doctoral Thesis, Faculté des Sciences Applique…
  • 1993
3 Excerpts

Similar Papers

Loading similar papers…