Find a copy in the library
Finding libraries that hold this item...
|All Authors / Contributors:||
Michael D Grigoriadis; Leonid Khachiyan
|Description:||17 leaves : illustrations ; 28 cm.|
|Series Title:||Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report|
|Responsibility:||M.D. Grigoriadis and L.G. Khachiyan.|
The method is shown to produce an [epsilon]-approximate solution in O(K(ln M)([epsilon]⁻² + ln K)) iterations, provided that there is a feasible solution sufficiently interior to the coupling inequalities. Each iteration consists of solving a subset of independent block problems, followed by a simple coordination step. Computational experiments with a set of large linear concurrent and minimum-cost multicommodity network flow problems suggest that the method can be practical for computing fast approximations to large instances."