(submitted In Partial Fulfillment Of The M.sc.degree In Mathematics)

Symmetric travelling sales man problem is a well known combinatorial optimization problem .Itrnis a problem of findining the shortest Hamiltonian cycle in a given weighted graph. In thisrnproject paper the symmetric travelling sales man problem, together with its mathematicalrnformulation and solution method ,especially the exact solution (Branch and bound approach) andrnan approximate(Heuristics approach) have been covered

Get Full Work

Report copyright infringement or plagiarism