Now showing items 1-1 of 1
Optimizing over the cut cone: A new polyhedral algorithm for the maximum-weight cut problem
Polyhedral cutting-plane algorithms for hard combinatorial problems have scored notable successes. However, computational research on the Maximum-Weight Cut Problem (MCP) on undirected graphs has been inconclusive. In 1988, ...