A minimum mean cycle cancelling method for nonlinear multicommodity flow problems

A minimum mean cycle cancelling method for nonlinear multicommodity flow problems

0.00 Avg rating0 Votes
Article ID: iaor2001494
Country: Netherlands
Volume: 121
Issue: 3
Start Page Number: 532
End Page Number: 548
Publication Date: Mar 2000
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: convex
Abstract:

We propose a new method based on minimum mean cycle cancelling for multicommodity flow problems with separable convex cost ruling out saturated capacities. This method is inspired by the cycle cancelling method first worked out by Goldberg and Tarjan for minimum cost circulations. Convergence of the method is formally proved and a variant with a more flexible selection of cycles is proposed. Also, we report some computational experience on the message routing problem in telecommunication networks using actual and randomly generated networks.

Reviews

Required fields are marked *. Your email address will not be published.