Title : ( a quadrstic binary formulation for a graph partitioning problem )
Authors: Amene Ghasab Mehrjerd , Reza Ghanbari , Freydoon Rahbarnia ,
Full TextAbstract
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.
Keywords
Graph partitioning; Quadratic binary formulation; CPLEX
@inproceedings{paperid:1035733,
author = {Ghasab Mehrjerd, Amene and Ghanbari, Reza and Rahbarnia, Freydoon},
title = {a quadrstic binary formulation for a graph partitioning problem},
booktitle = {ششمین کنفرانس بین المللی انجمن ایرانی تحقیق در عملیات},
year = {2013},
location = {تهران, IRAN},
keywords = {Graph partitioning; Quadratic binary formulation; CPLEX},
}
%0 Conference Proceedings
%T a quadrstic binary formulation for a graph partitioning problem
%A Ghasab Mehrjerd, Amene
%A Ghanbari, Reza
%A Rahbarnia, Freydoon
%J ششمین کنفرانس بین المللی انجمن ایرانی تحقیق در عملیات
%D 2013
