Show simple item record

Algorithms for the travelling salesman problem

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorBisseling, R.H.
dc.contributor.authorDroste, I.E.A.C.
dc.date.accessioned2018-07-23T17:02:11Z
dc.date.available2018-07-23T17:02:11Z
dc.date.issued2017
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/29854
dc.description.sponsorshipUtrecht University
dc.format.extent3525280
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleAlgorithms for the travelling salesman problem
dc.type.contentBachelor Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordstravelling salesman problem, algorithms, branch and bound, Ant Colony Optimisation
dc.subject.courseuuWiskunde


Files in this item

Thumbnail
Name:
BachelorthesisIsabelDroste.pdf
Size:
3.361Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record