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

A Suggested Computation for Maximal Multi-Commodity Network Flows

Author

Listed:
  • L. R. Ford, Jr.

    (The RAND Corporation, Santa Monica, California)

  • D. R. Fulkerson

    (The RAND Corporation, Santa Monica, California)

Abstract

(This article originally appeared in Management Science, October 1958, Volume 5, Number 1, pp. 97--101, published by The Institute of Management Sciences.) A simplex computation for an arc-chain formulation of the maximal multi-commodity network flow problem is proposed. Since the number of variables in this formulation is too large to be dealt with explicitly, the computation treats non-basic variables implicitly by replacing the usual method of determining a vector to enter the basis with several applications of a combinatorial algorithm for finding a shortest chain joining a pair of points in a network.

Suggested Citation

  • L. R. Ford, Jr. & D. R. Fulkerson, 2004. "A Suggested Computation for Maximal Multi-Commodity Network Flows," Management Science, INFORMS, vol. 50(12_supple), pages 1778-1780, December.
    • Handle: RePEc:inm:ormnsc:v:50:y:2004:i:12_supplement:p:1778-1780
    DOI: 10.1287/mnsc.1040.0269
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. R. E. Kalaba & M. L. Juncosa, 1956. "Optimal Design and Utilization of Communication Networks," Management Science, INFORMS, vol. 3(1), pages 33-44, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. İlker Baybars & Richard H. Edahl, 1988. "A heuristic method for facility planning in telecommunications networks with multiple alternate routes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(4), pages 503-528, August.
    2. Rajiv D. Banker & Robert J. Kauffman, 2004. "50th Anniversary Article: The Evolution of Research on Information Systems: A Fiftieth-Year Survey of the Literature in Management Science," Management Science, INFORMS, vol. 50(3), pages 281-298, March.

    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:50:y:2004:i:12_supplement:p:1778-1780. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.