IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2265.html
   My bibliography  Save this paper

A faster strongly polynomial minimum cost flow algorithm

Author

Listed:
  • Orlin, James B., 1953-.

Abstract

No abstract is available for this item.

Suggested Citation

  • Orlin, James B., 1953-., 1989. "A faster strongly polynomial minimum cost flow algorithm," Working papers 3060-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2265
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2265
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Morton Klein, 1967. "A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems," Management Science, INFORMS, vol. 14(3), pages 205-220, November.
    2. Orlin, James B., 1953-., 1988. "A faster strongly polynomial minimum cost flow algorithm," Working papers 2042-88., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    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. He, Xinyu & Li, Lishuai & Mo, Yanfang & Sun, Zhankun & Qin, S. Joe, 2025. "Air Corridor Planning for Urban Drone Delivery: Complexity Analysis and Comparison via Multi-Commodity Network Flow and Graph Search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 193(C).
    2. Ayoub Tahiri & David Ladeveze & Pascale Chiron & Bernard Archimede & Ludovic Lhuissier, 2018. "Reservoir Management Using a Network Flow Optimization Model Considering Quadratic Convex Cost Functions on Arcs," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 32(10), pages 3505-3518, August.
    3. Castro, Jordi & Nasini, Stefano, 2021. "A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks," European Journal of Operational Research, Elsevier, vol. 290(3), pages 857-869.
    4. Wang, Yan & Wang, Junwei, 2019. "Integrated reconfiguration of both supply and demand for evacuation planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 82-94.
    5. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    6. Torben S. D. Johansen, 2024. "Optimal Treatment Allocation under Constraints," Papers 2404.18268, arXiv.org.
    7. Mocquillon, Cédric & Lenté, Christophe & T'Kindt, Vincent, 2011. "An efficient heuristic for medium-term planning in shampoo production," International Journal of Production Economics, Elsevier, vol. 129(1), pages 178-185, January.
    8. Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang, 2021. "Algorithms for the metric ring star problem with fixed edge-cost ratio," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 499-523, October.
    9. Vladimir Lobantsov & Alexander Tizik & Vladimir Tsurkov & Ivan Matveev, 2025. "Decomposition Algorithm for a Nonlinear Three-Index Transportation Problem," Mathematics, MDPI, vol. 13(6), pages 1-11, March.
    10. Yoshio Kajitani & Daisuke Takabatake & Ayumi Yuyama & Tomomi Ishikawa & Wolfgang Kröger, 2023. "A framework to estimate a long-term power shortage risk following large-scale earthquake and tsunami disasters," PLOS ONE, Public Library of Science, vol. 18(3), pages 1-14, March.
    11. Xin Chen & Menglong Li, 2021. "Discrete Convex Analysis and Its Applications in Operations: A Survey," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1904-1926, June.
    12. Maiko Shigeno & Satoru Iwata & S. Thomas McCormick, 2000. "Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 76-104, February.
    13. Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang, 0. "Algorithms for the metric ring star problem with fixed edge-cost ratio," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-25.
    14. Balachandran Vaidyanathan & Ravindra K. Ahuja, 2010. "Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications," Operations Research, INFORMS, vol. 58(6), pages 1681-1696, December.
    15. Kevin D. Wayne, 2002. "A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 445-459, August.

    More about this item

    Keywords

    ;
    ;

    JEL classification:

    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:mit:sloanp:2265. 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: None The email address of this maintainer does not seem to be valid anymore. Please ask None to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.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.