Guta, Berhanu(PhD)Kefale, Adugna2018-07-112023-11-042018-07-112023-11-042014-06http://etd.aau.edu.et/handle/123456789/7907Symmetric travelling sales man problem is a well known combinatorial optimization problem .It is a problem of findining the shortest Hamiltonian cycle in a given weighted graph. In this project paper the symmetric travelling sales man problem, together with its mathematical formulation and solution method ,especially the exact solution (Branch and bound approach) and an approximate(Heuristics approach) have been coveredenSubmitted in partial fulfillmentof the M.Sc.degreeThesis