2026-09-20T22:58:46Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1038252022-01-13T07:54:52Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Jeremy F. Shapiro.
Baxter, Wayne Walter
Sloan School of Management.
Sloan School of Management
2016-08-02T20:05:58Z
2016-08-02T20:05:58Z
1968
http://hdl.handle.net/1721.1/103825
23852818
Massachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1968. M.S.
MICROFICHE COPY ALSO AVAILABLE IN DEWEY LIBRARY.
Bibliography: leaf 91.
M.S.
91 leaves
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Sloan School of Management.
A group theoretic-implicit enumeration algorithm for the traveling salesman problem.
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="21e04ce8-2acc-41dd-a659-a2ddb703fabc">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A group theoretic-implicit enumeration algorithm for the traveling salesman problem.</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>1968</PublicationDate>
<Authors>
<Author>
<DisplayName>Baxter, Wayne Walter</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Sloan School of Management.</Keyword>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>