AbstractThis report aims at a comprehensive survey of the literature dealing with the multicommodity flow problem. This problem arises naturally in network modelling wherever commodities, vehicles, or messages are to be shipped or transmitted from certain nodes of an underlying network to some others. Recent applications of mathematical programming techniques to traffic equilibrium problems in transportation studies as well as computer networks analysis has renewed considerable interest in this problem.This report discusses solution techniques for both linear and nonlinear flow problems. The former includes decomposition, partitioning, compact inverse methods, and primal‐dual algorithms. We describe a variety of feasible direction methods for the latter. The report concludes by giving applications and computational experience for both types of problem