Solving the maxcut problem by the global equilibrium search
- 57 Downloads
The authors propose an approach to the solution of the maxcut problem. It is based on the global equilibrium search method, which is currently one of the most efficient discrete programming methods. The efficiency of the proposed algorithm is analyzed.
Keywordscutset approximate methods global equilibrium search computational experiment algorithm efficiency
Unable to display preview. Download preview PDF.
- 5.I. V. Sergienko and V. P. Shilo, Discrete Optimization Problems: Challenges, Solution Methods, and Studies [in Russian], Naukova Dumka, Kyiv (2003).Google Scholar
- 11.G. Palubeckis and V. Krivickiene, “Application of multistart tabu search to the Max-Cut problem,” in: Information Technology and Control, 2(31), Technologija, Kaunas (2004), pp. 29–35.Google Scholar