(Submitted in partial fulfillment of the M.Sc.degree in mathematics)
No Thumbnail Available
Date
2014-06
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
Symmetric 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 covered
Description
Keywords
Submitted in partial fulfillment, of the M.Sc.degree