An empirical study of parallel genetic algorithms for the traveling salesman and job-shop scheduling problems

dc.contributor.authorHelzer, David Michaelen
dc.date.accessioned2015-05-12T20:45:58Z
dc.date.available2015-05-12T20:45:58Z
dc.date.issued2001en
dc.identifier.urihttps://scholarworks.montana.edu/handle/1/8104en
dc.language.isoenen
dc.publisherMontana State University - Bozeman, College of Engineeringen
dc.rights.holderCopyright 2001 by David Michael Helzeren
dc.subject.lcshGenetic algorithmsen
dc.subject.lcshParallel algorithmsen
dc.titleAn empirical study of parallel genetic algorithms for the traveling salesman and job-shop scheduling problemsen
dc.typeThesisen
thesis.catalog.ckey844881en
thesis.degree.departmentComputer Science.en
thesis.degree.genreThesisen
thesis.degree.nameMSen
thesis.format.extentfirstpage1en
thesis.format.extentlastpage95en

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
31762103507867.pdf
Size:
5.49 MB
Format:
Adobe Portable Document Format
Copyright (c) 2002-2022, LYRASIS. All rights reserved.