Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/3527
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Sandeep-
dc.contributor.authorTiwari, Sudhanshu P.-
dc.date.accessioned2019-06-24T07:27:34Z-
dc.date.available2019-06-24T07:27:34Z-
dc.date.issued2015-04-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/3527-
dc.language.isoenen_US
dc.publisherLovely Professional Universityen_US
dc.subjectComputer Science and Engineeringen_US
dc.titleTravelling Salesman Problem using hybrid ACO and Cuckoo Search algorithmen_US
dc.typeThesisen_US
Appears in Collections:Computer Science and Engineering (CSE)

Files in This Item:
File Description SizeFormat 
11310901_4_29_2015 3_30_58 PM_Final Dissertation Report.pdf1.04 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.