IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v131y2001i2p352-374.html
   My bibliography  Save this article

Time-varying minimum cost flow problems

Author

Listed:
  • Cai, X.
  • Sha, D.
  • Wong, C. K.

Abstract

No abstract is available for this item.

Suggested Citation

  • Cai, X. & Sha, D. & Wong, C. K., 2001. "Time-varying minimum cost flow problems," European Journal of Operational Research, Elsevier, vol. 131(2), pages 352-374, June.
    • Handle: RePEc:eee:ejores:v:131:y:2001:i:2:p:352-374
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00059-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. James B. Orlin, 1984. "Minimum Convex Cost Dynamic Network Flows," Mathematics of Operations Research, INFORMS, vol. 9(2), pages 190-207, May.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. S. Khodayifar & M. A. Raayatpanah & P. M. Pardalos, 2019. "A polynomial time algorithm for the minimum flow problem in time-varying networks," Annals of Operations Research, Springer, vol. 272(1), pages 29-39, January.
    2. Koch, Ronald & Nasrabadi, Ebrahim, 2014. "Flows over time in time-varying networks: Optimality conditions and strong duality," European Journal of Operational Research, Elsevier, vol. 237(2), pages 580-589.
    3. Bozhenyuk Alexander & Gerasimenko Evgeniya, 2013. "Algorithm for Monitoring Minimum Cost in Fuzzy Dynamic Networks," Information Technology and Management Science, Sciendo, vol. 16(1), pages 53-59, December.

    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. Orlin, James B., 1953-., 1985. "The complexity of dynamic/periodic languages and optimization problems," Working papers 1679-85., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    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:eee:ejores:v:131:y:2001:i:2:p:352-374. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.