Professor Jinaguo Liu invites you to attend the Masters project defense of Jose-Luis Paukner-Moron on Tuesday, July 2nd at 2:00 pm in in GAB 438. Cookies and coffee will be served in GAB 472 following this event. "Lin Kernighan and Grouping Implementations for the Traveling Salesman Problem" Abstract: Given the cost to travel between some group of cities, find the cheapest closed round trip that visit all of them once". Solutions to the general underlying problem can be applied by busy salesmen, project planners, even robots manufacturing circuit plates. Many different approach to a solution are available. In this work, particular techniques that generate reasonable solutions are considered. We will see notation that describes how methods improve a given solution, describe the Lin Keringan and Grouping techniques and compare the results of its implementations.