2026-09-21T18:29:28Zhttps://digital.library.adelaide.edu.au/server/oai/request

oai:digital.library.adelaide.edu.au:2440/1150642026-06-12T08:05:37Zcom_2440_14759col_2440_14760

Thompson, Glen R. Dept. of Mathematics 1968 http://hdl.handle.net/2440/115064 Ch. 1. Introduction -- Ch. 2. Some results concerning p-optimality -- Ch. 3. Algorithms for the travelling salesman problem -- Ch. 4. Discussion. Thesis (Ph.D.) -- University of Adelaide, Dept. of Mathematics, 1968 en Combinatorial analysis; Travelling-salesman problem Analysis of a combinatorial approach to the travelling salesman problem Theses This electronic version is made publicly available by the University of Adelaide in accordance with its open access policy for student theses. Copyright in this thesis remains with the author. This thesis may incorporate third party material which has been used by the author pursuant to Fair Dealing exceptions. If you are the owner of any included third party copyright material you wish to be removed from this electronic version, please complete the take down form located at: http://www.adelaide.edu.au/legalsopen.access