Transportation problem . Find a flow of least cost that ships from supply sources to consumer destinations. Same as a theorem of the alternative . Transshipment problem . This is an extension of the transportation problem whereby the network is not bipartite.
Additional nodes serve as transshipment points, rather than provide supply or final consumption.
A is an arbitrary set of arcs, and there could also be capacity constraints. The TSP is to find a tour of minimum total cost. Then, the subtour elimination constraints have sums over arcs whose head is in V . See the n -Opt heuristic. Triangle inequality .