IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v49y2001i4p501-515.html
   My bibliography  Save this article

Online Searching

Author

Listed:
  • Patrick Jaillet

    (MSIS Department and Civil Engineering Department, The University of Texas at Austin, Austin Texas 78712)

  • Matthew Stafford

    (SBC Technology Resources, Inc., 9505 Arboretum Blvd., Austin, Texas 78759)

Abstract

We consider the problem of searching m branches which, with the exception of a common source s , are disjoint (hereafter called concurrent branches). A searcher, starting at s , must find a given “exit” t whose location, unknown to the searcher, is on one of the m branches. The problem is to find a strategy that minimizes the worst-case ratio between the total distance traveled and the length of the shortest path from s to t . Additional information may be available to the searcher before he begins his search.In addition to finding optimal or near optimal deterministic online algorithms for these problems, this paper addresses the “value” of getting additional information before starting the search.

Suggested Citation

  • Patrick Jaillet & Matthew Stafford, 2001. "Online Searching," Operations Research, INFORMS, vol. 49(4), pages 501-515, August.
    • Handle: RePEc:inm:oropre:v:49:y:2001:i:4:p:501-515
    DOI: 10.1287/opre.49.4.501.11227
    as

    Download full text from publisher

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

    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:49:y:2001:i:4:p:501-515. 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.