The relax codes for linear minimum cost network flow problems
نویسندگان
چکیده
منابع مشابه
The Relax Codes for Linear Minimum Cost Network Flow Problems*
We describe a relaxation algorithm [ 1,2] for solving the classical minimum cost net-work flow problem. Our implementation is compared with mature state-of-the-artprimal simplex and primal-dual codes and is found to be several times faster on alltypes of randomly generated network flow problems. Furthermore, the speed-upfactor increases with problem dimension. The codes, called ...
متن کاملRELAX-IV: A Faster Version of the RELAX Code for Solving Minimum Cost Flow Problems
The structure of dual ascent methods is particularly well-suited for taking advantage of good initial dual solutions of minimum cost flow problems. For this reason, these methods are extremely efficient for reoptimization and sensitivity analysis. In the absence of prior knowledge of a good initial dual solution, one may attempt to find such a solution by means of a heuristic initialization. RE...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
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.
متن کاملOn Minimum Concave Cost Network Flow Problems
Minimum concave Cost Network Flow Problems (MCNFPs) arise naturally in many practical applications such as communication, transportation, distribution, and manufacturing, due to economic considerations. In addition, it has been shown that every MCNFP with general nonlinear cost functions can be transformed into a concave MCNFP on an expanded network. It must also be noted, that multiple source ...
متن کاملthe minimum universal cost flow in an infeasible flow network
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.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 1988
ISSN: 0254-5330,1572-9338
DOI: 10.1007/bf02288322