- transportation(+Supplies, +Demands, +Costs, -Transport)
- Solves a transportation problem. Supplies and Demands must be lists
of non-negative integers. Their respective sums must be equal. Costs
is a list of lists representing the cost matrix, where an entry
(i,j) denotes the integer cost of transporting one unit from i
to j. A transportation plan having minimum cost is computed and
unified with Transport in the form of a list of lists that
represents the transportation matrix, where element (i,j)
denotes how many units to ship from i to j.
