ششمین کنفرانس بین المللی انجمن ایرانی تحقیق در عملیات , 2013-05-08
Title : ( a quadrstic binary formulation for a graph partitioning problem )
Authors: Amene Ghasab Mehrjerd , Reza Ghanbari , Freydoon Rahbarnia ,File: Full Text
Abstract
Graph partitioning is a useful technique for solving many problems in scientific computing, such as domain decomposition for parallel iterative linear system solvers, VLSI circuit layout, or image segmentation, among others. The graph partitioning is usually stated as a single-objective optimization problem. Here, we present a quadratic binary formulation to find the minimum cost partition of the nodes of an undirected graph into non-empty subsets, subject to the constraints must be satisfied.