IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-030-19111-5_8.html
   My bibliography  Save this book chapter

Neighbourhood Reduction in Global and Combinatorial Optimization: The Case of the p-Centre Problem

In: Contributions to Location Analysis

Author

Listed:
  • Said Salhi

    (University of Kent)

  • Jack Brimberg

    (The Royal Military College of Canada)

Abstract

Neighbourhood reductions for a class of location problems known as the vertex (or discrete) and planar (or continuous) p-centre problems are presented. A brief review of these two forms of the p-centre problem is first provided followed by those respective reduction schemes that have shown to be promising. These reduction schemes have the power of transforming optimal or near optimal methods such as metaheuristics or relaxation-based procedures, which were considered relatively slow, into efficient and exciting ones that are now able to find optimal solutions or tight lower/upper bounds for larger instances. Research highlights of neighbourhood reduction for global and combinatorial optimisation problems in general and for related location problems in particular are also given.

Suggested Citation

  • Said Salhi & Jack Brimberg, 2019. "Neighbourhood Reduction in Global and Combinatorial Optimization: The Case of the p-Centre Problem," International Series in Operations Research & Management Science, in: H. A. Eiselt & Vladimir Marianov (ed.), Contributions to Location Analysis, chapter 0, pages 195-220, Springer.
  • Handle: RePEc:spr:isochp:978-3-030-19111-5_8
    DOI: 10.1007/978-3-030-19111-5_8
    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.

    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-3-030-19111-5_8. 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.