p-center problems
Date
2015
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Print ISSN
Electronic ISSN
Publisher
Springer
Volume
Issue
Pages
79 - 92
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
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.
Course
Other identifiers
Book Title
Location science