A Branch-and-Cut Algorithm for the k-Edge Connected Subgraph Problem
In this article, we consider the k-edge connected sub-graph problem from a polyhedral point of view. We introduce further classes of valid inequalities for the associated polytope and describe sufficient conditions for these inequalities to be facet defining. We also devise separation routines for these inequalities and discuss some reduction operations that can be used in a preprocessing phase for the separation. Using these results, we develop a Branch-and-Cut algorithm and present some computational results. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 55(1), 13-32 2010
branch-and-cut polytope facet separation reduction operations k-edge connected graph