You've Heard About the Traveling Salesman Problem. How About the Traveling Welding Robots?

Many introductory computer science programs will cover the traveling salesman problem as an example of an NP-hard problem that becomes too complex for a…