An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum -Bundle Problem
The Maximum s-Bundle Problem (MBP) addresses the task of identifying a maximum s-
bundle in a given graph. A graph G=(V, E) is called an s-bundle if its vertex connectivity is at …
bundle in a given graph. A graph G=(V, E) is called an s-bundle if its vertex connectivity is at …