IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v43y2009i3p437-448.html
   My bibliography  Save this article

New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels

Author

Listed:
  • A. Sedeño-Noda
  • C. González-Martín

Abstract

No abstract is available for this item.

Suggested Citation

  • A. Sedeño-Noda & C. González-Martín, 2009. "New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels," Computational Optimization and Applications, Springer, vol. 43(3), pages 437-448, July.
    • Handle: RePEc:spr:coopap:v:43:y:2009:i:3:p:437-448
    DOI: 10.1007/s10589-007-9144-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-007-9144-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-007-9144-7?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.

    References listed on IDEAS

    as
    1. W. H. Cunningham, 1979. "Theoretical Properties of the Network Simplex Method," Mathematics of Operations Research, INFORMS, vol. 4(2), pages 196-208, May.
    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. 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.
    2. ÇalIskan, Cenk, 2011. "A specialized network simplex algorithm for the constrained maximum flow problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 137-147, April.
    3. Sedeno-Noda, A. & Gonzalez-Martin, C. & Gutierrez, J., 2005. "The biobjective undirected two-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 89-103, July.
    4. Donald Goldfarb & Zhiying Jin, 1999. "An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem," Operations Research, INFORMS, vol. 47(3), pages 445-448, June.
    5. Sedeno-Noda, A. & Gonzalez-Martin, C., 2000. "The biobjective minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 124(3), pages 591-600, August.
    6. Holzhauser, Michael & Krumke, Sven O. & Thielen, Clemens, 2017. "A network simplex method for the budget-constrained minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 259(3), pages 864-872.

    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:spr:coopap:v:43:y:2009:i:3:p:437-448. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.