%0 Journal Article
%T The Minimum Universal Cost Flow in an Infeasible Flow Network
%J Journal of Sciences, Islamic Republic of Iran
%I University of Tehran
%Z 1016-1104
%D 2006
%\ 06/01/2006
%V 17
%N 2
%P -
%! The Minimum Universal Cost Flow in an Infeasible Flow Network
%R
%X 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.
%U https://jsciences.ut.ac.ir/article_31735_af68f37c949f280419ac36be10d89754.pdf