Randomized heuristics for the Max-Cut problem

著者: Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro - Optimization methods & software 2002 被引用: 230

Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized.