| dc.contributor.advisor | Ronald L. Rivest and Michael Athans. | en_US |
| dc.contributor.author | Kanellakis, Paris C | en_US |
| dc.date.accessioned | 2005-08-03T22:14:47Z | |
| dc.date.available | 2005-08-03T22:14:47Z | |
| dc.date.issued | 1978 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/16223 | |
| dc.description | Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. | en_US |
| dc.description | MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING | en_US |
| dc.description | Includes bibliographical references. | en_US |
| dc.format.extent | 121 leaves | en_US |
| dc.format.extent | 6331599 bytes | |
| dc.format.extent | 6331357 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Massachusetts Institute of Technology | en_US |
| 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. | en_US |
| dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | |
| dc.subject | Electrical Engineering and Computer Science | en_US |
| dc.subject.lcsh | Traveling-salesman problem | en_US |
| dc.subject.lcsh | Algorithms | en_US |
| dc.subject.lcsh | Production scheduling | en_US |
| dc.title | Algorithms for a scheduling application of the Asymmetric Traveling Salesman Problem. | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | M.S. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.identifier.oclc | 06370876 | en_US |
