IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-96935-6_2.html
   My bibliography  Save this book chapter

Discrete Location Problems with Uncertainty

In: The Palgrave Handbook of Operations Research

Author

Listed:
  • Nader Azizi

    (University of Edinburgh)

  • Sergio García

    (University of Edinburgh)

  • Chandra Ade Irawan

    (University of Nottingham Ningbo China)

Abstract

Discrete facility location problems consist in finding the best set of facilities over a finite set of potential sites so that a certain service is provided: goods delivered from a warehouse, emergency vehicles that provide first aid or take sick people to hospitals, shops that are near the potential customers, etc. Although when these problems were introduced in the literature, exact and precise information on the data was assumed, it is nowadays clear that this is rarely true. Therefore, models that account for uncertainty are required. In this chapter we will survey three of the most important families of problems in discrete facility location: the single-source capacitated facility location problem, covering problems, and hub location problems. The main contributions and solution methods in the area are reviewed for these problems, including formulations for some of the models and solution methods.

Suggested Citation

  • Nader Azizi & Sergio García & Chandra Ade Irawan, 2022. "Discrete Location Problems with Uncertainty," Springer Books, in: Saïd Salhi & John Boylan (ed.), The Palgrave Handbook of Operations Research, chapter 0, pages 43-71, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-96935-6_2
    DOI: 10.1007/978-3-030-96935-6_2
    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.

    More about this item

    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:sprchp:978-3-030-96935-6_2. 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.