The TSP_Chart15.lng Model

Traveling Salesman Problem

View the model
Download the model

Find the shortest tour that visits each city exactly once.
In terms of a communication network, a TSP solution is a ring network.
It is the simplest network that can tolerate the failure of one arc and still allow all nodes to communicate.
The Miller, Tucker, Zemlin, 1960, J. ACM, single commodity formulation;


Network Design | Routing | TSP | Sequencing | Traveling Sales Person | Tour | Great Circle Distance | Graph | Chart | ChartNetNode |