Skip to main content
SpringerLink
Log in

The p-Centre Problem—Heuristic and Optimal Algorithms

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

The p-centre problem, or minimax location-allocation problem in location theory terminology, is the following: given n demand points on the plane and a weight associated with each demand point, find p new facilities on the plane that minimize the maximum weighted Euclidean distance between each demand point and its closest new facility. We present two heuristics and an optimal algorithm that solves the problem for a given p in time polynomial in n. Computational results are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Management, The University of Michigan-Dearborn,

    Zvi Drezner

Authors
  1. Zvi Drezner
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Drezner, Z. The p-Centre Problem—Heuristic and Optimal Algorithms. J Oper Res Soc 35, 741–748 (1984). https://doi.org/10.1057/jors.1984.150

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1984.150

Search

Navigation