IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v27y2010i06ns0217595910002946.html
   My bibliography  Save this article

Shortest Path Simplex Algorithm With A Multiple Pivot Rule: A Comparative Study

Author

Listed:
  • A. SEDEÑO-NODA

    (Departamento de Estadística, Investigación Operativa y Computación (DEIOC), Universidad de La Laguna, 38205- La Laguna, Tenerife (España), Spain)

  • C. GONZÁLEZ-MARTÍN

    (Departamento de Estadística, Investigación Operativa y Computación (DEIOC), Universidad de La Laguna, 38205- La Laguna, Tenerife (España), Spain)

Abstract

This paper introduces a newmultiple pivotshortest path simplex method by choosing a subset of non-basic arcs to simultaneously enter into the basis. It is shown that the proposed shortest path simplex method requiresO(n)multiple pivots and its running time isO(nm). Results from a computational study comparing the proposed method from previously known methods are reported. The experimental show that the proposed rule is more efficient than the considered shortest path simplex pivot rules.

Suggested Citation

  • A. Sedeño-Noda & C. González-Martín, 2010. "Shortest Path Simplex Algorithm With A Multiple Pivot Rule: A Comparative Study," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(06), pages 677-691.
    • Handle: RePEc:wsi:apjorx:v:27:y:2010:i:06:n:s0217595910002946
    DOI: 10.1142/S0217595910002946
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595910002946
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595910002946?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
    ---><---

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

    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:wsi:apjorx:v:27:y:2010:i:06:n:s0217595910002946. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.