IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v40y1992i1-supplement-1ps5-s13.html
   My bibliography  Save this article

The Scaling Network Simplex Algorithm

Author

Listed:
  • Ravindra K. Ahuja

    (Indian Institute of Technology, Kanpur, India)

  • James B. Orlin

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

Abstract

In this paper, we present a new primal simplex pivot rule and analyze the worst case complexity of the resulting simplex algorithm for the minimum cost flow, the assignment, and the shortest path problems. We consider networks with n nodes, m arcs, integral arc capacities bounded by an integer number U , and integral arc costs whose magnitudes are bounded by an integer number C . Our pivot rule may be regarded as a scaling version of Dantzig's pivot rule. Our pivot rule defines a threshold value Δ, which is initially at most 2 C , and the rule permits any arc with a violation of at least Δ/2 to be the editing variable. We select the leaving arc so that strong feasibility of the basis is maintained. When there is no arc satisfying this rule, then we replace Δ by Δ/2 and repeat the process. The algorithm terminates when Δ O ( nmU log C ) pivots and can be implemented to run in O ( m 2 U log C ) time. Specializing these results for the assignment and shortest path problems we show that the simplex algorithm solves these problems in O ( n 2 log C ) pivots and O ( nm log C ) time.

Suggested Citation

  • Ravindra K. Ahuja & James B. Orlin, 1992. "The Scaling Network Simplex Algorithm," Operations Research, INFORMS, vol. 40(1-supplem), pages 5-13, February.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:1-supplement-1:p:s5-s13
    DOI: 10.1287/opre.40.1.S5
    as

    Download full text from publisher

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

    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:40:y:1992:i:1-supplement-1:p:s5-s13. 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.