Skip to main content
Book Chapter

p-Center Problems

  • Calik H
  • Labbé M
  • Yaman H
Springer International Publishing, (2015), 79-92
DOI: 10.1007/978-3-319-13111-5_4
N/ACitations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A p-center is a minimax solution that consists in a set of p points that minimizes the maximum distance between a demand point and a closest point belonging to that set. We present different variants of that 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.

Cite

CITATION STYLE

APA

Calik, H., Labbé, M., & Yaman, H. (2015). p-Center Problems. In Location Science (pp. 79–92). Springer International Publishing. https://doi.org/10.1007/978-3-319-13111-5_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free