Most notorious hard graph problem
Traveling Salesman Problem
- Input description: A weighted graph G, B >= 0
- Output description: Is there a cycle going through each of the vertices once of total cost at most B?
-
Example: optimization of tool path for manufacturing equipment. E.g., robot arm assigned to solder all connections on printed circuit board.