The max-cut problem is a standard NP-hard problem in graph graphic theory.

最大割问题是图论中的一个典型的NP困难问题。

youdao

Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.

在该模型的基础上，利用分枝定界算法求解最大割问题。

youdao

In this paper, a quadratic programming algorithm is presented to solve Max-cut problem.

本文给出了最大割问题的二次规划算法。

youdao