In 1987, Madfred Padberg and Giovanni Rinaldi found the optimal solution for a 532-city instance created by Shen Lin of AT&T. In this work, Padberg and Rinaldi coined the phrase "branch-and-cut" algorithm for branch-and-bound together with the cutting-plane method. A higher resolution version of the tour image can be found in the Pictorial History of the TSP.