Consider a state-flipping algorithm for the Maximum-Cut problem.

Consider a state-flipping algorithm for the Maximum-Cut problem. We say that partitions $$(A, B)$$ and $$(A', B')$$ are neighbors under the $$k$$-flip rule if $$(A', B')$$ can be obtained from $$(A, B)$$ by moving at most $$k$$ nodes from one side of the partition to the other. If $$(A, B)$$ is a local optimum under the $$p$$-flip rule, it is also a local optimum under the $$k$$-flip rule for every $$k < p$$. ~@[](2)

答案：TRUE