Solving the Graph Bisection Problem with Imperialist Competitive Algorithm

Abstract

Imperialist competitive algorithm is a method in complementary calculations which is dealing with finding an optimum response in different optimization problems. Though its initial versions are introduced in order to solve the optimization problems, it is used in discrete problems, too. The Binary discrete method is offered in this article on the basis of… (More)

Topics

Cite this paper

@inproceedings{SoltanpoorSolvingTG, title={Solving the Graph Bisection Problem with Imperialist Competitive Algorithm}, author={Hodais Soltanpoor and Shirin Nozarian and Majid VafaeiJahan} }