Back to results
Massachusetts Institute of Technology
A group theoretic-implicit enumeration algorithm for the traveling salesman problem.
Abstract
dc:descriptionMassachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1968. M.S.
Degree
thesis:*- Department dc:contributor.department
- Sloan School of Management.
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 1968
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Baxter, Wayne Walter
- Advisor dc:contributor.advisor
-
- Jeremy F. Shapiro.
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- 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.
- Licence dc:rights.uri
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1721.1/103825
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/103825