Show simple item record

dc.contributor.advisorRonald L. Rivest and Michael Athans.en_US
dc.contributor.authorKanellakis, Paris Cen_US
dc.date.accessioned2005-08-03T22:14:47Z
dc.date.available2005-08-03T22:14:47Z
dc.date.issued1978en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/16223
dc.descriptionThesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.en_US
dc.descriptionMICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERINGen_US
dc.descriptionIncludes bibliographical references.en_US
dc.format.extent121 leavesen_US
dc.format.extent6331599 bytes
dc.format.extent6331357 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectElectrical Engineering and Computer Scienceen_US
dc.subject.lcshTraveling-salesman problemen_US
dc.subject.lcshAlgorithmsen_US
dc.subject.lcshProduction schedulingen_US
dc.titleAlgorithms for a scheduling application of the Asymmetric Traveling Salesman Problem.en_US
dc.typeThesisen_US
dc.description.degreeM.S.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc06370876en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record