IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v14y1966i3p377-387.html
   My bibliography  Save this article

On Two Commodity Network Flows

Author

Listed:
  • B. Rothschild

    (Yale University, New Haven, Connecticut)

  • A. Whinston

    (University of Virginia, Charlottesville, Virginia)

Abstract

The paper considers the problem of two-commodity network flows and generalizes a result of Hu on integral flows in networks with integral capacities. The main result of the paper is a max-flow min-cut theorem for two commodity networks. The method of proof involves a particular type of separation process. This leads to an algorithm for finding the maximal flows. Several counterexamples to certain possible generalizations are given at the end of the paper.

Suggested Citation

  • B. Rothschild & A. Whinston, 1966. "On Two Commodity Network Flows," Operations Research, INFORMS, vol. 14(3), pages 377-387, June.
    • Handle: RePEc:inm:oropre:v:14:y:1966:i:3:p:377-387
    DOI: 10.1287/opre.14.3.377
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.14.3.377
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.14.3.377?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lin, Yi-Kuei, 2006. "A simple algorithm to generate all (d,B)-MCs of a multicommodity stochastic-flow network," Reliability Engineering and System Safety, Elsevier, vol. 91(8), pages 923-929.
    2. Lin, Yi-Kuei, 2007. "Reliability of a computer network in case capacity weight varying with arcs, nodes and types of commodity," Reliability Engineering and System Safety, Elsevier, vol. 92(5), pages 646-652.
    3. Lin, Yi-Kuei, 2010. "A stochastic model to study the system capacity for supply chains in terms of minimal cuts," International Journal of Production Economics, Elsevier, vol. 124(1), pages 181-187, March.
    4. Lin, Yi-Kuei, 2007. "Generate upper boundary vectors meeting the demand and budget for a p-commodity network with unreliable nodes," European Journal of Operational Research, Elsevier, vol. 183(1), pages 253-262, November.
    5. Lin, Yi-Kuei, 2007. "Performance evaluation for the logistics system in case that capacity weight varies from arcs and types of commodity," International Journal of Production Economics, Elsevier, vol. 107(2), pages 572-580, June.
    6. A. Sedeño-Noda & C. González-Martín & S. Alonso-Rodríguez, 2010. "A new strategy for the undirected two-commodity maximum flow problem," Computational Optimization and Applications, Springer, vol. 47(2), pages 289-305, October.
    7. Sedeno-Noda, A. & Gonzalez-Martin, C. & Gutierrez, J., 2005. "The biobjective undirected two-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 89-103, July.
    8. Lin, Yi-Kuei, 2007. "On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint," European Journal of Operational Research, Elsevier, vol. 176(1), pages 347-360, January.
    9. Costa, Marie-Christine & Letocart, Lucas & Roupin, Frederic, 2005. "Minimal multicut and maximal integer multiflow: A survey," European Journal of Operational Research, Elsevier, vol. 162(1), pages 55-69, April.

    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:oropre:v:14:y:1966:i:3:p:377-387. 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.