We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

A group theoretic-implicit enumeration algorithm for the traveling salesman problem.

Thumbnail Image
Download
Name

23852818-MIT.pdf

Description
Full printable version
Size

3.17 MB

Format

Adobe PDF

Checksum (MD5)

0197767a1ddb4ef13937393e4fd826ce

Author(s)
Baxter, Wayne Walter
Advisor(s)
Jeremy F. Shapiro.
Date Issued
1968
Publisher
Massachusetts Institute of Technology
Description
Massachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1968. M.S.
MICROFICHE COPY ALSO AVAILABLE IN DEWEY LIBRARY.
Bibliography: leaf 91.
Subjects
Sloan School of Management.
MIT Department
Sloan School of Management
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.