Statement
Traveling salesman problem
Given a list of
cities and a symmetric distance function . What is an ordering on , with that visits every city and has minimum length ?
Traveling salesman problem
Given a list of
cities and a symmetric distance function . What is an ordering on , with that visits every city and has minimum length ?