Samenvatting
A transportation network is considered. The traffic demands associated with pairs of nodes and the (convex) travelling cost functions associated with the links are assumed given. The two problems of finding the traffic patterns which either minimize the total cost or equilibrate the users costs are formulated, and algorithms are constructed for the solution of these problems.