Title of article
The Minimum Universal Cost Flow in an Infeasible Flow Network
Author/Authors
Salehi Fathabadi، H. Department of Mathematics, Statistics, and Computer Science - Faculty of Sciences - University of Tehran, Tehran, Iran , Bagherian، M. No Affiliation
Issue Information
فصلنامه با شماره پیاپی 0 سال 2006
Pages
6
From page
175
To page
180
Abstract
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
Abstract
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
Keywords
Infeasible flow network , Minimum cost network flow problem
Journal title
Journal of Sciences
Serial Year
2006
Journal title
Journal of Sciences
Record number
2386266
Link To Document