Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm