IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v15y2007i2p372-382.html
   My bibliography  Save this article

Computational experiments with a lazy version of a K quickest simple path ranking algorithm

Author

Listed:
  • M. Pascoal

    ()

  • M. Captivo

    ()

  • J. Clímaco

    ()

Abstract

No abstract is available for this item.

Suggested Citation

  • M. Pascoal & M. Captivo & J. Clímaco, 2007. "Computational experiments with a lazy version of a K quickest simple path ranking algorithm," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(2), pages 372-382, December.
  • Handle: RePEc:spr:topjnl:v:15:y:2007:i:2:p:372-382 DOI: 10.1007/s11750-007-0033-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-007-0033-0
    Download Restriction: Access to full text is restricted to subscribers.

    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. Derks, Jean & Peters, Hans, 1993. "A Shapley Value for Games with Restricted Coalitions," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(4), pages 351-360.
    2. Michel Grabisch & Jacques Duchêne & Frédéric Lino & Patrice Perny, 2002. "Subjective Evaluation of Discomfort in Sitting Position," Post-Print halshs-00273179, HAL.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sedeño-Noda, Antonio & González-Barrera, Jonathan D., 2014. "Fast and fine quickest path algorithm," European Journal of Operational Research, Elsevier, vol. 238(2), pages 596-606.

    More about this item

    Keywords

    Graph algorithms; Networks; Quickest path; Ranking; 90C27; 90C35;

    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:spr:topjnl:v:15:y:2007:i:2:p:372-382. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.