Browsing by Subject "p-Center"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    p-center problems
    (Springer, 2015) Çalık, Hatice; Labbé, M.; Yaman, Hande; Laporte, G.; Nickel, S.; Gama, F. S. da
    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.
  • Thumbnail Image
    ItemOpen Access
    Planar p-center problem with Tchebychev distance
    (1994) Yılmaz, Dilek
    The p-center problem is a model for locating p facilities to serve clients so that the distance between a farthest client and its closest facility is minimized. Emergency service facilities such as fire stations, hospitals and police stations are most of the time located in this manner. In this thesis, the planar p-center problem with Tchebychev distance is studied. The problem is known to be NPHard. We identify certain polynomial time solvable cases and give an efficient branching method which makes use of polynomial time methods in subproblem solutions whenever possible. In addition, a dual problem is posed in light of the existing duality theory on tree networks.