Develops a price-directive algorithm for solving the minimum cost multicommodity flow problem. The algorithm is a specialization of Balas' infeasibility pricing method. The subproblems are first solved and the infeasibility in the common resources is used to generate a new direction for the price vector. By making use of the network structure, the process of finding the new direction is simplified. The subproblems are solved only once and the procedure is illustrated by a numerical example.
An infeasibility pricing algorithm for the multicommodity minimum cost flow problem
Ein Algorithmus des nichterhaeltlichen Preises fuer das Problem minimaler Warenkosten
Computers and Operations Research ; 5 , 4 ; 251-261
1978
11 Seiten, 25 Quellen
Article (Journal)
English
Cost Optimisation Tool for Multicommodity Network Flow Problem in Telecommunications
DOAJ | 2024
|The congested multicommodity network design problem
Online Contents | 2016
|The Multicommodity-Ring Location Routing Problem
Online Contents | 2016
|The Multicommodity-Ring Location Routing Problem
British Library Online Contents | 2016
|