Show simple item record

dc.contributor.advisorJeremy F. Shapiro.en_US
dc.contributor.authorBaxter, Wayne Walteren_US
dc.contributor.otherSloan School of Management.en_US
dc.date.accessioned2016-08-02T20:05:58Z
dc.date.available2016-08-02T20:05:58Z
dc.date.issued1968en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/103825
dc.descriptionMassachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1968. M.S.en_US
dc.descriptionMICROFICHE COPY ALSO AVAILABLE IN DEWEY LIBRARY.en_US
dc.descriptionBibliography: leaf 91.en_US
dc.format.extent91 leavesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectSloan School of Management.en_US
dc.titleA group theoretic-implicit enumeration algorithm for the traveling salesman problem.en_US
dc.typeThesisen_US
dc.description.degreeM.S.en_US
dc.contributor.departmentSloan School of Management
dc.identifier.oclc23852818en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record