An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem