Search Results - subject:"Branch and cut algorithm"

Polyhedral Computations for the Simple Graph Partitioning Problem

Sørensen, Michael M. - Ehrvervøkonomisk Institut, Institut for Økonomi - 2005

present a branch-and-cut algorithm for the problem that uses several classes of facet-defining inequalities as cuttingplanes … overall performance of the branch-and-cut algorithm several computational experiments are conducted. We present some of the …

Persistent link: https://www.econbiz.de/10005802234

The Node Capacitated Graph Partitioning Problem : A Computational Study

FERREIRA, Carlos E.; SOUZA, Cid C. de; MARTIN, Alexander; … - Center for Operations Research and Econometrics (CORE), … - 1994

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...

Persistent link: https://www.econbiz.de/10005043233