On October 21, 2025, William Cook from University of Waterloo gave a talk at the Discrete Math Seminar on using branch-decompositions for discrete optimization problems, including the traveling salesman problem. The title of his talk was “Optimization via Branch Decomposition“.


