A modified VNS metaheuristic for max-bisection problems (Q939544): Difference between revisions

The authors design a variable neighborhood search metaheuristic to solve max-bisection problems. The max-bisection problem is transferred into an equivalent quadratic optimization problem which has the same feasible region as the max-cut problem. Then the modified variable neighborhood search metaheuristic by using a distinct local search is applied to solve the optimization problem. Some numerical experimental results are presented by comparing the proposed method to an existing approximate algorithm.