Armbruster M, Fügenschuh M, Helmberg C, Jetchev N, Martin A (2005)
Publication Language: English
Publication Type: Book chapter / Article in edited volumes
Publication year: 2005
Publisher: Springer, Berlin
Edited Volumes: Operations Research Proceedings 2005, Bremen, September 7-9, 2005
Pages Range: 315-320
Conference Proceedings Title: Operations Research Proceedings 2005, Bremen, September 7-9, 2005
We investigate the minimum graph bisection problem concerning partitioning the nodes of a graph into two subsets such that the total weight of each set is within some lower and upper limits. The objective is to minimize the total cost of edges between both subsets of the partition. This problem has a variety of applications, for instance in the design of electronic circuits and in parallel computing. We present an integer linear programming formulation for this problem. We develop a primal heuristic based on a genetic algorithm, incorporate it in a branch-and-cut framework and present some computational results.
APA:
Armbruster, M., Fügenschuh, M., Helmberg, C., Jetchev, N., & Martin, A. (2005). LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. In Operations Research Proceedings 2005, Bremen, September 7-9, 2005. (pp. 315-320). Springer, Berlin.
MLA:
Armbruster, Michael, et al. "LP-based Genetic Algorithm for the Minimum Graph Bisection Problem." Operations Research Proceedings 2005, Bremen, September 7-9, 2005. Springer, Berlin, 2005. 315-320.
BibTeX: Download