George Dantzig coauthored a large traveling-salesman computation with Delbert Ray Fulkerson and Selmer M. Johnson. Their work connected a candidate route with optimization bounds and additional constraints establishing that no cheaper route was possible.[ref]
Solution of a Large-Scale Traveling-Salesman Problem by George B. Dantzig and others. author attribution and the described mathematical development
Portrait of George Dantzig
. Unknown author; 1936 Terrapin yearbook, p. 54; levels and noise reduction by Commons user Based5290. Public domain in the United States: copyright not renewed (PD-US-not-renewed). Source usage terms, via Wikimedia Commons. Source.
George Dantzig was an American mathematician and statistician, best known for his contributions to operations research and linear programming. He was born on November 8, 1914, and passed away on May 13, 2005. Dantzig developed the simplex algorithm, a method for solving linear programming problems, which has had a profound impact on various fields, including economics, engineering, and military logistics.
New to topics? Read the docs here!