A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs [chapter]

Martin Bergner, Marco E. Lübbecke, Jonas T. Witt
2014 Lecture Notes in Computer Science  
The cut packing problem in an undirected graph is to find a largest cardinality collection of pairwise edge-disjoint cuts. We provide the first experimental study of this NP-hard problem that interested theorists and practitioners alike. We propose a branch-price-and-cut algorithm to optimally solve instances from various graph classes, random and from the literature, with up to several hundred vertices. In particular we investigate how complexity results match computational experience and how
more » ... ombinatorial properties help improving the algorithm's performance.
doi:10.1007/978-3-319-07959-2_4 fatcat:5mfzxx42m5c6zbff6g2d625xbi