G.B. Dantzig, D.R. Fulkerson, S.M. Johnson. Two Papers. (1) "Solution for a large-scale traveling-salesman problem" (1954) AND (Ibid.) (2) "On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem" (1959) both in "Operations Research".

G.B. Dantzig, D.R. Fulkerson, S.M. Johnson. Two Papers.

Published by Operations Research Society, 1954

About this Item

G.B. Dantzig, D.R. Fulkerson, S.M. Johnson. Two Papers. (1) "Solution for a large-scale traveling-salesman problem" (1954) AND (Ibid.) (2) "On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem" (1959) both in "Operations Research". Two items. [++] (Dantzig 1954, #1 is found in the "Journal of the Operations Research Society of America" 2 (1954), pp. 393-41 in the full bound volume of 470, 40pp. Bound in cloth and decorated boards. FINE copy. AND #2, Operations Research, January-February 1959, vol 7 number 1, with the Dantzig on pp 58-66 in the issue of pp 1-142. This is the original issue, in wrappers. The spine has been expertly restored. [++] "Dantzig, Fulkerson and Johnson solved the 49-city instance by solving a sequence of linear programs, starting with the fundamental inequalities, and adding successive cuts as required to exclude fractional optimal solutions."--"George Dantzig s impact on the theory of computation" by Richard M. Karp, in "Discrete Optimization," Volume 5, Issue 2, May 2008, Pages 174-185. Karp continues: "George Dantzig will go down in history as one of the founders and chief contributors to the field of mathematical programming, and as the creator of the simplex algorithm for linear programming, perhaps the most important algorithm developed in the 20th century. --"George Dantzig s impact on the theory of computation"--Karp, ibid. Dantzig was one of the three founders of linear programming, a mathematical method used for the optimum allocation of scarce resources among competing activities… [Dantzig] discovered that many such allocation problems could be formulated as linear computer programs (Jeremy Norman, Origins of Cyberspace, 92) [++] Also in the issue with #2 is Alfred HAUSRATH, "Utilization of Negro Manpower in the Army", a foundation paper in equality and race relations.  The ORO (The Johns Hopkins University Operations Research Office) instituted a study in 1951 by a team of five analysts headed by Dr. Alfred Hausrath (a war games researcher) to study the effects of integration, part of which was published in the report "Utilization of Negro Manpower in the Army",  with the full three-volume publication of the study coming slightly later in 1954.   (Two earlier interim reports were issued in July and December 1951.) Basically, after everything was said and done, Hausrath and his team found that integrated units work much better than segregated units. The report "provided policymakers in the Army with the objective arguments in favor of integrated units", and the policy changes for full integration of the Army were issued just months after this report was rendered, in July 1951. This document was printed for the first time in a general format for OR folks in 1953.  (The term "landmark" was used to describe this paper in Saul Gass' "An Annotated Timeline of Operations Research," an Informal History, page 80.).

Seller Inventory # ABE-1708275501117

Bibliographic Details

• Title: G.B. Dantzig, D.R. Fulkerson, S.M. Johnson. Two Papers. (1) "Solution for a large-scale traveling-salesman problem" (1954) AND (Ibid.) (2) "On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem" (1959) both in "Operations Research".
• Publisher: Operations Research Society
• Publication Date: 1954
• Binding: Hardcover
• Condition: Very Good
• Seller catalogs:
  • Computing History
  • Social History