Return to search

Algorithms for a scheduling application of the Asymmetric Traveling Salesman Problem.

Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING / Includes bibliographical references. / M.S.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/16223
Date January 1978
CreatorsKanellakis, Paris C
ContributorsRonald L. Rivest and Michael Athans., Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science
PublisherMassachusetts Institute of Technology
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
TypeThesis
Format121 leaves, 6331599 bytes, 6331357 bytes, application/pdf, application/pdf, application/pdf
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., http://dspace.mit.edu/handle/1721.1/7582

Page generated in 0.0169 seconds