다종류 상품 흐름 문제에 대한 반복행 연산법

초록

Multicommodity flow problems arise when several commodities use the same underlying network. In this paper, multicommodity flow problem is formulated in nonlinear programming problem. We propose an algorithm for solving this problem. It is useful for large scale and sparse problems. Then we prove the convergence of the proposed algorithm.