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

p-Center Problems

In: Location Science

Author

Listed:
  • Hatice Çalık

    (KU Leuven, Department of Computer Science, CODeS)

  • Martine Labbé

    (Université Libre de Bruxelles, Department of Computer Science
    Inria Lille-Nord Europe)

  • Hande Yaman

    (ORSTAT, KU Leuven, Faculty of Economics and Business
    Bilkent University, Department of Industrial Engineering)

Abstract

A p-center is a minimax solution that consists of a set of p points minimizing the maximum distance between a demand point and a closest point belonging to that set. We present different variants of this problem. We review special polynomial cases, determine the complexity of the problems and present mixed integer linear programming formulations, exact algorithms and heuristics. Several extensions are also reviewed.

Suggested Citation

  • Hatice Çalık & Martine Labbé & Hande Yaman, 2019. "p-Center Problems," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 2, chapter 0, pages 51-65, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-32177-2_3
    DOI: 10.1007/978-3-030-32177-2_3
    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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    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-32177-2_3. 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.