Statement
Traveling salesman problem (search)
Given a list of
cities , a symmetric distance function and a goal . Is there an ordering on , with , that visits every city and has length if it exists?
Traveling salesman problem (search)
Given a list of
cities , a symmetric distance function and a goal . Is there an ordering on , with , that visits every city and has length if it exists?