IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4419-0790-5_7.html
   My bibliography  Save this book chapter

Search

In: Combat Modeling

Author

Listed:
  • Alan Washburn

    (Naval Postgraduate School)

  • Moshe Kress

    (Naval Postgraduate School)

Abstract

First of all, the subject of this chapter is not searching on the internet. Nor is it searching for a job or inner peace, and it has nothing to do with data mining. These initial caveats are necessary because practically all intellectual activity can be thought of as a search for something, so the term “search” by itself implies very little. It is an outright mistake to say “search” to a search engine, and even “search theory” will expose many entries having nothing to do with what we have in mind.

Suggested Citation

  • Alan Washburn & Moshe Kress, 2009. "Search," International Series in Operations Research & Management Science, in: Combat Modeling, chapter 0, pages 133-160, Springer.
    • Handle: RePEc:spr:isochp:978-1-4419-0790-5_7
    DOI: 10.1007/978-1-4419-0790-5_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Baruch Mor & Gur Mosheiov, 2017. "A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1454-1468, May.
    2. Gur Mosheiov & Assaf Sarig & Vitaly Strusevich, 2020. "Minmax scheduling and due-window assignment with position-dependent processing times and job rejection," 4OR, Springer, vol. 18(4), pages 439-456, December.
    3. Baruch Mor, 2019. "Minmax scheduling problems with common due-date and completion time penalty," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 50-71, July.
    4. Long Zhang & Yuzhong Zhang & Qingguo Bai, 0. "An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.

    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:isochp:978-1-4419-0790-5_7. 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: 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.