Solution of Traveling Salesman Problem Using Genetic Algorithm

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 289
  • Download : 0
DC FieldValueLanguage
dc.contributor.author박철훈-
dc.date.accessioned2013-03-14T17:10:48Z-
dc.date.available2013-03-14T17:10:48Z-
dc.date.created2012-02-06-
dc.date.issued1992-
dc.identifier.citationProceedings of Korean Signal Processing Conference, v., no., pp.590 - 593-
dc.identifier.urihttp://hdl.handle.net/10203/111115-
dc.languageKOR-
dc.titleSolution of Traveling Salesman Problem Using Genetic Algorithm-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage590-
dc.citation.endingpage593-
dc.citation.publicationnameProceedings of Korean Signal Processing Conference-
dc.identifier.conferencecountrySouth Korea-
dc.identifier.conferencecountrySouth Korea-
dc.contributor.localauthor박철훈-
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0