By Topic

Aspects of the traveling salesman problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Held, M. ; IBM Academic Information Systems, 1 North Broadway, White Plains, New York 10601, USA ; Hoffman, A.J. ; Johnson, E.L. ; Wolfe, P.

For fifty years the traveling salesman problem has fascinated mathematicians, computer scientists, and laymen. It is easily stated, but hard to solve; it has become the prototypical hard problem in theoretical computer science. A large part of the extensive research conducted by IBM in the broad area of optimization, or mathematical programming, contributed to or was inspired by aspects of this challenging problem. This article reviews some of that work as well as recent developments in techniques that were used on the largest traveling salesman problem ever solved.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:28 ,  Issue: 4 )