IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v19y1973i9p1087-1092.html
   My bibliography  Save this article

Minimal Cost Cut Equivalent Networks

Author

Listed:
  • Jean-Claude Picard

    (École Polytechnique, Montreal)

  • H. Donald Ratliff

    (University of Florida)

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.

Suggested Citation

  • Jean-Claude Picard & H. Donald Ratliff, 1973. "Minimal Cost Cut Equivalent Networks," Management Science, INFORMS, vol. 19(9), pages 1087-1092, May.
    • Handle: RePEc:inm:ormnsc:v:19:y:1973:i:9:p:1087-1092
    DOI: 10.1287/mnsc.19.9.1087
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.19.9.1087
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.19.9.1087?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:19:y:1973:i:9:p:1087-1092. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.