A branch-and-cut algorithm for the undirected selective traveling salesman problem