The node capacitated graph partitioning problem: A computational study
- 1 April 1998
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 81 (2) , 229-256
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Solving Multiple Knapsack Problems by Cutting PlanesSIAM Journal on Optimization, 1996
- The optimal graph partitioning problemOR Spectrum, 1993
- Min-cut clusteringMathematical Programming, 1993
- On the multiway cut polyhedronNetworks, 1991
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- A cutting plane algorithm for a clustering problemMathematical Programming, 1989
- On the magnetisation of the ground states in two dimensional Ising spin glassesComputer Physics Communications, 1988
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout DesignOperations Research, 1988
- On the cut polytopeMathematical Programming, 1986
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970