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

A polynomial time primal network simplex algorithm for minimum cost flows

Author

Listed:
  • Orlin, James B., 1953-

Abstract

No abstract is available for this item.

Suggested Citation

  • Orlin, James B., 1953-, 1995. "A polynomial time primal network simplex algorithm for minimum cost flows," Working papers 3834-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2584
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Éva Tardos, 1986. "A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs," Operations Research, INFORMS, vol. 34(2), pages 250-256, April.
    2. Donald Goldfarb & Jianxiu Hao & Sheng-Roan Kai, 1990. "Efficient Shortest Path Simplex Algorithms," Operations Research, INFORMS, vol. 38(4), pages 624-628, August.
    3. James B. Orlin, 1993. "A Faster Strongly Polynomial Minimum Cost Flow Algorithm," Operations Research, INFORMS, vol. 41(2), pages 338-350, April.
    4. Ravindra K. Ahuja & James B. Orlin, 1992. "The Scaling Network Simplex Algorithm," Operations Research, INFORMS, vol. 40(1-supplem), pages 5-13, February.
    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. Konstantinos Paparrizos & Nikolaos Samaras & Angelo Sifaleras, 2015. "Exterior point simplex-type algorithms for linear and network optimization problems," Annals of Operations Research, Springer, vol. 229(1), pages 607-633, June.
    2. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.
    3. László A. Végh, 2017. "A Strongly Polynomial Algorithm for Generalized Flow Maximization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 179-211, January.
    4. Prabhjot Kaur & Anuj Sharma & Vanita Verma & Kalpana Dahiya, 2022. "An alternate approach to solve two-level hierarchical time minimization transportation problem," 4OR, Springer, vol. 20(1), pages 23-61, March.
    5. Hochbaum, Dorit S., 2002. "Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations," European Journal of Operational Research, Elsevier, vol. 140(2), pages 291-321, July.
    6. Ting Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz, 2016. "Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 333-364, March.
    7. R. B. Bapat & S. K. Neogy, 2016. "On a quadratic programming problem involving distances in trees," Annals of Operations Research, Springer, vol. 243(1), pages 365-373, August.
    8. Dereniowski, Dariusz & Kubiak, Wiesław, 2020. "Shared processor scheduling of multiprocessor jobs," European Journal of Operational Research, Elsevier, vol. 282(2), pages 464-477.
    9. Amitai Armon & Iftah Gamzu & Danny Segev, 2014. "Mobile facility location: combinatorial filtering via weighted occupancy," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 358-375, August.
    10. Wang, Gang, 2024. "Order assignment and two-stage integrated scheduling in fruit and vegetable supply chains," Omega, Elsevier, vol. 124(C).
    11. Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, September.
    12. Amitabh Basu & Jesús A. De Loera & Mark Junod, 2014. "On Chubanov's Method for Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 336-350, May.
    13. Shoshana Anily, 1996. "The vehicle‐routing problem with delivery and back‐haul options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 415-434, April.
    14. Mao-Cheng Cai & Xiaoguang Yang & Yanjun Li, 1999. "Inverse Polymatroidal Flow Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 115-126, July.
    15. D. V. Gribanov & D. S. Malyshev & P. M. Pardalos & S. I. Veselov, 2018. "FPT-algorithms for some problems related to integer programming," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1128-1146, May.
    16. Yosuke Hanawa & Yuya Higashikawa & Naoyuki Kamiyama & Naoki Katoh & Atsushi Takizawa, 2018. "The mixed evacuation problem," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1299-1314, November.
    17. M. Cai & X. Yang & Y. Li, 2000. "Inverse Problems of Submodular Functions on Digraphs," Journal of Optimization Theory and Applications, Springer, vol. 104(3), pages 559-575, March.
    18. Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.
    19. Paulo Oliveira, 2014. "A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(3), pages 267-284, December.
    20. Adam N. Letchford, 2000. "Separating a Superclass of Comb Inequalities in Planar Graphs," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 443-454, August.

    More about this item

    Keywords

    HD28 .M414 no.3834-95;

    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:2584. 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 (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.