Gama, F. S. da
79 - 92
Item Usage Stats
MetadataShow full item record
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.
Published Version (Please cite this version)https://doi.org/10.1007/978-3-319-13111-5_4