Travelling Salesman Problem

The Travelling Salesman Problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science.

Unfortunately, the BMAS model is related to the class of n-p hard problems that can be found in the integer programming literature (like the travelling salesman problem).

travelling salesman problem p. 203 given a graph connecting a set of nodes, devise a route that visits each node in the graph exactly once and minimizes the total cost accumulated. trend surface p.

See also: GIS, Network, Map, Information, Location