Minimal Cost Cut Equivalent Networks

Jean-Claude Picard and H. Donald Ratliff
Additional contact information
Jean-Claude Picard: École Polytechnique, Montreal
H. Donald Ratliff: University of Florida

Management Science, 1973, vol. 19, issue 9, 1087-1092

Abstract: This paper is concerned with the following problem in network synthesis. Suppose that we are given a network with real-valued capacities on each arc. There is a cost associated with each arc which is proportional to the magnitude of the arc capacity. We wish to determine new arc capacities such that the capacity of each cut in the new network differs from the capacity of the corresponding cut in the original network by a specified constant and such that the total cost is minimized. This problem is shown to be equivalent to solving a minimum cost flow problem on a related network.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.9.1087 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:19:y:1973:i:9:p:1087-1092

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().