Abstract
Given a network with flow costs and arc capacities, the classical min-cost flow problem is to send a given amount of flow from the source node to the sink node at least cost. This paper proposes a new variant of the min-cost flow problem by including a fixed cost into the model and by changing the goal as to minimize the average cost. In other words, we assume that the total cost includes two terms: one is the fixed cost of using the network to send flow; the other is a variable cost per unit of flow on the arc. Under this cost assumption, our goal is to minimize the average cost of sending flow. This paper develops an efficient algorithm for this problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
