A group theoretic-implicit enumeration algorithm for the traveling salesman problem.
Massachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1968. M.S.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/103825 |
| _version_ | 1826192007012286464 |
|---|---|
| author | Baxter, Wayne Walter |
| author2 | Jeremy F. Shapiro. |
| author_facet | Jeremy F. Shapiro. Baxter, Wayne Walter |
| author_sort | Baxter, Wayne Walter |
| collection | MIT |
| description | Massachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1968. M.S. |
| first_indexed | 2024-09-23T09:04:45Z |
| format | Thesis |
| id | mit-1721.1/103825 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T09:04:45Z |
| publishDate | 2016 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1038252019-04-10T20:37:31Z A group theoretic-implicit enumeration algorithm for the traveling salesman problem. Baxter, Wayne Walter Jeremy F. Shapiro. Sloan School of Management. Sloan School of Management. Sloan School of Management. 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. 2016-08-02T20:05:58Z 2016-08-02T20:05:58Z 1968 Thesis http://hdl.handle.net/1721.1/103825 23852818 eng 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 91 leaves application/pdf Massachusetts Institute of Technology |
| spellingShingle | Sloan School of Management. Baxter, Wayne Walter A group theoretic-implicit enumeration algorithm for the traveling salesman problem. |
| title | A group theoretic-implicit enumeration algorithm for the traveling salesman problem. |
| title_full | A group theoretic-implicit enumeration algorithm for the traveling salesman problem. |
| title_fullStr | A group theoretic-implicit enumeration algorithm for the traveling salesman problem. |
| title_full_unstemmed | A group theoretic-implicit enumeration algorithm for the traveling salesman problem. |
| title_short | A group theoretic-implicit enumeration algorithm for the traveling salesman problem. |
| title_sort | group theoretic implicit enumeration algorithm for the traveling salesman problem |
| topic | Sloan School of Management. |
| url | http://hdl.handle.net/1721.1/103825 |
| work_keys_str_mv | AT baxterwaynewalter agrouptheoreticimplicitenumerationalgorithmforthetravelingsalesmanproblem AT baxterwaynewalter grouptheoreticimplicitenumerationalgorithmforthetravelingsalesmanproblem |