Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Solution of a Large-Scale Traveling-Salesman Problem

G. Dantzig, R. Fulkerson and S. Johnson
Journal of the Operations Research Society of America
Vol. 2, No. 4 (Nov., 1954), pp. 393-410
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/166695
Page Count: 18
  • Download ($30.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Solution of a Large-Scale Traveling-Salesman Problem
Preview not available

Abstract

It is shown that a certain tour of 49 cities, one in each of the 48 states and Washington, D. C., has the shortest road distance.

Page Thumbnails

  • Thumbnail: Page 
393
    393
  • Thumbnail: Page 
394
    394
  • Thumbnail: Page 
[395]
    [395]
  • Thumbnail: Page 
396
    396
  • Thumbnail: Page 
397
    397
  • Thumbnail: Page 
398
    398
  • Thumbnail: Page 
399
    399
  • Thumbnail: Page 
400
    400
  • Thumbnail: Page 
401
    401
  • Thumbnail: Page 
402
    402
  • Thumbnail: Page 
403
    403
  • Thumbnail: Page 
404
    404
  • Thumbnail: Page 
405
    405
  • Thumbnail: Page 
406
    406
  • Thumbnail: Page 
407
    407
  • Thumbnail: Page 
408
    408
  • Thumbnail: Page 
409
    409
  • Thumbnail: Page 
410
    410